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.BufferedReader;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
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;
		InputStreamReader in = new InputStreamReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {
    public void solve(int testNumber, InputStreamReader inSt, PrintWriter out) {
        InputReader in = new InputReader(inSt);

        long a = in.nextInt();
        long b = in.nextInt();
        String str = in.next();

        long[] first = new long[str.length() + 1];
        long[] second = new long[str.length() + 1];
        first[0] = 0;
        second[0] = 0;

        for (int i = 0; i < str.length(); i++) {
            char ch = str.charAt(i);
            if (ch == 'U') {
                first[i + 1] = first[i];
                second[i + 1] = second[i] + 1;
            } else if (ch == 'D') {
                first[i + 1] = first[i];
                second[i + 1] = second[i] - 1;

            } else if (ch == 'L') {
                first[i + 1] = first[i] - 1;
                second[i + 1] = second[i];
            } else if (ch == 'R') {
                first[i + 1] = first[i] + 1;
                second[i + 1] = second[i];
            }
        }
        for (int i = 0; i < first.length; i++) {
            if ((first[i] == a) && (second[i] == b)) {
                out.println("Yes");
                return;
            }
        }

        long diffX = first[first.length - 1] - first[0];
        long diffY = second[second.length - 1] - second[0];

        boolean isOk = false;
        for (int i = 0; i < first.length; i++) {
            if (couldBe(diffX, diffY, first[i], second[i], a, b)) {
                isOk = true;
                break;
            }
        }

        if (isOk) {
            out.println("Yes");
        } else {
            out.println("No");
        }
    }

    private boolean couldBe(long diffX, long diffY, long startX, long startY, long endX, long endY) {
        if ((diffX == 0) && (diffY == 0)) {
            if (startX != endX) {
                return false;
            } else if (startY != endY) {
                return false;
            } else {
                return true;
            }
        }

        if (diffX == 0) {
            if (startX != endX) {
                return false;
            }
            long tmp = (endY - startY) / diffY;
            if ((tmp > 0) && ((tmp * diffY) == (endY - startY))) {
                return true;
            } else {
                return false;
            }
        }

        if (diffY == 0) {
            if (startY != endY) {
                return false;
            }
            long tmp = (endX - startX) / diffX;
            if ((tmp > 0) && ((tmp * diffX) == (endX - startX))) {
                return true;
            } else {
                return false;
            }
        }

        long tmpX = (endX - startX) / diffX;
        long tmpY = (endY - startY) / diffY;
        if (tmpX != tmpY) {
            return false;
        }
        if (tmpX <= 0) {
            return false;
        }

        if (((tmpX * diffX) == (endX - startX)) && ((tmpY * diffY) == (endY - startY))) {
            return true;
        }

        return false;
    }

    class InputReader {
        public BufferedReader reader;
        private String[] currentArray;
        int curPointer;

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

        public String next() {
            try {
                currentArray = null;
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

        public int nextInt() {
            if ((currentArray == null) || (curPointer >= currentArray.length)) {
                try {
                    currentArray = reader.readLine().split(" ");
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                curPointer = 0;
            }
            return Integer.parseInt(currentArray[curPointer++]);
        }

    }
}

