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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int a = in.nextInt();
            int b = in.nextInt();
            String s = in.next();

            int[] localX = new int[s.length() + 1];
            int[] localY = new int[s.length() + 1];
            for (int i = 1; i <= s.length(); i++) {
                switch (s.charAt(i - 1)) {
                    case 'U':
                        localX[i] = localX[i - 1];
                        localY[i] = localY[i - 1] + 1;
                        break;
                    case 'D':
                        localX[i] = localX[i - 1];
                        localY[i] = localY[i - 1] - 1;
                        break;
                    case 'L':
                        localX[i] = localX[i - 1] - 1;
                        localY[i] = localY[i - 1];
                        break;
                    case 'R':
                        localX[i] = localX[i - 1] + 1;
                        localY[i] = localY[i - 1];
                        break;
                }
            }
            for (int i = 0; i <= s.length(); i++) {
                int xStart = a - localX[i];
                int yStart = b - localY[i];

                if (divisible(xStart, yStart, localX[s.length()], localY[s.length()])) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

        boolean divisible(long x1, long y1, long x2, long y2) {
            if (x1 == 0 && y1 == 0) return true;
            if (x1 * x2 >= 0 && y1 * y2 >= 0 && y2 * x1 == y1 * x2) {
                long len1s = x1 * x1 + y1 * y1;
                long len2s = x2 * x2 + y2 * y2;
                if (len2s != 0 && len1s % len2s == 0) {
                    return true;
                }
            }
            return false;
        }

    }

    static class InputReader {
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private void fillTokenizer() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            fillTokenizer();
            return tokenizer.nextToken();
        }

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

    }
}

