Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:

  * 'U': go up, (x, y)  →  (x, y+1); 
  * 'D': go down, (x, y)  →  (x, y-1); 
  * 'L': go left, (x, y)  →  (x-1, y); 
  * 'R': go right, (x, y)  →  (x+1, y). 



The robot will do the operations in s from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (a, b).

Input

The first line contains two integers a and b, ( - 109 ≤ a, b ≤ 109). The second line contains a string s (1 ≤ |s| ≤ 100, s only contains characters 'U', 'D', 'L', 'R') — the command.

Output

Print "Yes" if the robot will be located at (a, b), and "No" otherwise.

Examples

Input

2 2
RU


Output

Yes


Input

1 2
RU


Output

No


Input

-1 1000000000
LRRLU


Output

Yes


Input

0 0
D


Output

Yes

Note

In the first and second test case, command string is "RU", so the robot will go right, then go up, then right, and then up and so on.

The locations of its moves are (0, 0)  →  (1, 0)  →  (1, 1)  →  (2, 1)  →  (2, 2)  →  ...

So it can reach (2, 2) but not (1, 2).
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.text.*;

public class cf322c {

    static BufferedReader br;
    static Scanner sc;
    static PrintWriter out;

    public static void initA() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            //br = new BufferedReader(new FileReader("input.txt"));
            sc = new Scanner(System.in);
            //out = new PrintWriter("output.txt");
            out = new PrintWriter(System.out);
        } catch (Exception e) {
        }
    }

    static boolean next_permutation(Integer[] p) {
        for (int a = p.length - 2; a >= 0; --a) {
            if (p[a] < p[a + 1]) {
                for (int b = p.length - 1;; --b) {
                    if (p[b] > p[a]) {
                        int t = p[a];
                        p[a] = p[b];
                        p[b] = t;
                        for (++a, b = p.length - 1; a < b; ++a, --b) {
                            t = p[a];
                            p[a] = p[b];
                            p[b] = t;
                        }
                        return true;
                    }
                }
            }
        }
        return false;
    }

    public static void initB() {
        try {

            br = new BufferedReader(new FileReader("input.txt"));
            sc = new Scanner(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");

        } catch (Exception e) {
        }
    }

    public static String getString() {
        try {
            return br.readLine();
        } catch (Exception e) {
        }
        return "";
    }

    public static Integer getInt() {
        try {
            return Integer.parseInt(br.readLine());
        } catch (Exception e) {
        }
        return 0;
    }

    public static Integer[] getIntArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            Integer temp2[] = new Integer[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = Integer.parseInt(temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }

    public static Long[] getLongArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            Long temp2[] = new Long[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = Long.parseLong(temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }

    public static String[] getStringArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            String temp2[] = new String[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = (temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }

    public static void print(Object a) {
        System.out.println(a);
    }

    public static void print(String s, Object... a) {
        System.out.printf(s, a);
    }

    public static int nextInt() {
        return sc.nextInt();
    }

    public static double nextDouble() {
        return sc.nextDouble();
    }

    public static void main(String[] ar) {
        initA();
        solve();
        out.flush();
    }

    static long abs(long a) {
        return Math.abs(a);
    }

    public static void solve() {
        Integer xx[] = getIntArr();
        int cx = 0, cy = 0, fx = xx[0], fy = xx[1];


        if (fx == 0 && fy == 0) {
            print("Yes");
            return;
        }

        char langkah[] = getString().toCharArray();

        int n = langkah.length;
        int dpx[] = new int[n];
        int dpy[] = new int[n];

        for (int i = 0; i < n; i++) {
            if (langkah[i] == 'U') {
                if (i == 0) {
                    dpy[i]++;
                } else {
                    dpy[i] = dpy[i - 1] + 1;
                    dpx[i] = dpx[i - 1];
                }
            }
            if (langkah[i] == 'D') {
                if (i == 0) {
                    dpy[i]--;
                } else {
                    dpy[i] = dpy[i - 1] - 1;
                    dpx[i] = dpx[i - 1];
                }
            }
            if (langkah[i] == 'L') {
                if (i == 0) {
                    dpx[i]--;
                } else {
                    dpx[i] = dpx[i - 1] - 1;
                    dpy[i] = dpy[i - 1];
                }
            }
            if (langkah[i] == 'R') {
                if (i == 0) {
                    dpx[i]++;
                } else {
                    dpx[i] = dpx[i - 1] + 1;
                    dpy[i] = dpy[i - 1];
                }
            }
            if (dpx[i] == fx && dpy[i] == fy) {
                print("Yes");
                return;
            }
        }
        /*
        for (int i = 0; i < dpx.length; i++) {
        print(dpx[i] + " " + dpy[i]);
        }
        print("FIN");
         */

        int px = dpx[n - 1], py = dpy[n - 1];
        //print(px + " " + py);
        for (int i = 0; i < n; i++) {
            int mx = dpx[i];
            int my = dpy[i];

            int sx = fx - mx, sy = fy - my;

            if (sx > 0 && px <= 0) {
                continue;
            }
            if (sy > 0 && py <= 0) {
                continue;
            }
            if (sx < 0 && px >= 0) {
                continue;
            }
            if (sy < 0 && py >= 0) {
                continue;
            }

            //print("DEB " + sx + " " + sy);

            if (sx == 0 && px == 0 && sy % py == 0) {
                print("Yes");
                return;
            }
            if (sx == 0 && px == 0 && sy % py != 0) {
                continue;
            }
            if (sy == 0 && py == 0 && sx % px == 0) {
                print("Yes");
                return;
            }
            if (sy == 0 && py == 0 && sx % px != 0) {
                continue;
            }


            if (sx % px == 0 && sy % py == 0 && sx / px == sy / py) {
                print("Yes");
                return;
            }
        }
        print("No");





    }
}
