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).
import java.io.*;
import java.util.*;

public class CF {
    FastScanner in;
    PrintWriter out;

    boolean check(int stX, int stY, String s, int nx, int ny) {
        if (stX == nx && stY == ny)
            return true;
        int x = stX;
        int y = stY;
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (c == 'U') {
                y++;
            } else {
                if (c == 'D') {
                    y--;
                } else {
                    if (c == 'R') {
                        x++;
                    } else {
                        x--;
                    }
                }
            }
            if (x == nx && y == ny)
                return true;
        }
        return false;
    }

    void solve() {
        int a = in.nextInt();
        int b = in.nextInt();
        String s = in.next();
        int x = 0;
        int y = 0;
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (c == 'U') {
                y++;
            } else {
                if (c == 'D') {
                    y--;
                } else {
                    if (c == 'R') {
                        x++;
                    } else {
                        x--;
                    }
                }
            }
        }
        boolean ok = check(0, 0, s, a, b);
        int time = 0;
        if (x != 0) {
            time = a / x;
            int stTime = Math.max(0, time - 1000);
            int lastTime = time + 1000;
            for (int t = stTime; t < lastTime; t++) {
                long curX = x * 1L * t;
                long curY = y * 1L * t;
                if (curX >= 2 * 1e9 || curY > 2 * 1e9)
                    continue;
                int cx = (int) curX;
                int cy = (int) curY;
                ok |= check(cx, cy, s, a, b);
            }
        }
        if (y != 0) {
            time = b / y;
            int stTime = Math.max(0, time - 1000);
            int lastTime = time + 1000;
            for (int t = stTime; t < lastTime; t++) {
                long curX = x * 1L * t;
                long curY = y * 1L * t;
                if (curX >= 2 * 1e9 || curY > 2 * 1e9)
                    continue;
                int cx = (int) curX;
                int cy = (int) curY;
                ok |= check(cx, cy, s, a, b);
            }
        }
        
        if (ok) {
            out.println("Yes");
        } else {
            out.println("No");
        }

    }

    void run() {
        try {
            in = new FastScanner(new File("object.in"));
            out = new PrintWriter(new File("object.out"));

            solve();

            out.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }

    void runIO() {

        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);

        solve();

        out.close();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return null;
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }

    public static void main(String[] args) {
        new CF().runIO();
    }
}