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 A {

	long dx, dy, a, b;

	void run() throws IOException {
		a = ni();
		b = ni();
		dx = dy = 0;

		char[] path = nl().toCharArray();
		int n = path.length;

		boolean q = a == 0 && b == 0;

		for (int i = 0; i < n; i++) {
			if (path[i] == 'U') {
				dy++;
			} else if (path[i] == 'R') {
				dx++;
			} else if (path[i] == 'L') {
				dx--;
			} else {
				dy--;
			}
		}

		q |= can(dx, dy);
		for (int i = 0, x = 0, y = 0; i < n; i++) {
			if (path[i] == 'U') {
				y++;
			} else if (path[i] == 'R') {
				x++;
			} else if (path[i] == 'L') {
				x--;
			} else {
				y--;
			}
			q |= can(x, y);
		}

		pw.println(q ? "Yes" : "No");

	}

	boolean can(long x, long y) {
		if (x < a && dx <= 0)
			return false;
		if (y < b && dy <= 0)
			return false;
		if (x > a && dx >= 0)
			return false;
		if (y > b && dy >= 0)
			return false;

		long u = a - x;
		long v = b - y;

		if (dx == 0 && dy == 0) {
			return x == a && y == b;
		}

		if (dx == 0) {
			if (x != a) {
				return false;
			}
			return v % dy == 0;
		}
		if (dy == 0) {
			if (y != b) {
				return false;
			}
			return u % dx == 0;
		}
		return u % dx == 0 && v % dy == 0 && u / dx == v / dy;
	}

	int[][] nm(int a_len, int a_hei) throws IOException {
		int[][] _a = new int[a_len][a_hei];
		for (int i = 0; i < a_len; i++)
			for (int j = 0; j < a_hei; j++)
				_a[i][j] = ni();
		return _a;
	}

	String next() throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	int[] na(int a_len) throws IOException {
		int[] _a = new int[a_len];
		for (int i = 0; i < a_len; i++)
			_a[i] = ni();
		return _a;
	}

	int ni() throws IOException {
		return Integer.parseInt(next());
	}

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

	String nl() throws IOException {
		return br.readLine();
	}

	void tr(String debug) {
		if (!OJ)
			pw.println(" " + debug);
	}

	static PrintWriter pw;
	static BufferedReader br;
	static StringTokenizer st;
	static boolean OJ;

	public static void main(String[] args) throws IOException {
		long timeout = System.currentTimeMillis();
		OJ = System.getProperty("ONLINE_JUDGE") != null;
		pw = new PrintWriter(System.out);
		br = new BufferedReader(OJ ? new InputStreamReader(System.in) : new FileReader(new File("A.txt")));
		while (br.ready())
			new A().run();
		if (!OJ) {
			pw.println("----------------------------------");
			pw.println(System.currentTimeMillis() - timeout);
		}
		br.close();
		pw.close();
	}

}
