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 static java.lang.Math.*; 

import java.io.*; 
import java.util.*; 

public class Template {
	BufferedReader in; 
	PrintWriter out;
	StringTokenizer st; 

	String next() {
		while (st==null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(in.readLine());
			} catch (Exception e) {}
		}
		return st.nextToken(); 
	}

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

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

	double nextDouble() {
		return Double.parseDouble(next());
	}
	
	class Point implements Comparable<Point> {
		int x, y; 
		public Point(int x, int y) {
			this.x=x; 
			this.y=y; 
		}

		public boolean equals(Object o) {
			Point other = (Point)o; 
			return (x == other.x && y == other.y);
		}

		public int hashCode() {
			return x * 256 + y; 
		}

		public int compareTo(Point o) {
			if (x!=o.x) return sign(x-o.x); else return sign(y - o.y);
		}

		public int sign(int x) {
			if (x==0) return 0; 
			if (x<0) return -1; 
			return 1; 
		}
		              
		public String toString() {
			return x + " " + y; 
		}
	}

	public void run() throws Exception {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
			int a = nextInt(); 
			int b = nextInt(); 

			String s = next(); 
			int[] x = new int[120]; 
			int[] y = new int[120]; 

			int n = s.length(); 

			for (int i=1; i<=n; i++) {
				x[i] = x[i-1] + (s.charAt(i - 1) == 'L' ? -1 : (s.charAt(i - 1) == 'R' ? 1 : 0)); 
				y[i] = y[i-1] + (s.charAt(i - 1) == 'D' ? -1 : (s.charAt(i - 1) == 'U' ? 1 : 0)); 
			}

			boolean ok = false; 
			for (int i=0; i<n; i++) {
				int aa = a - x[i];
				int bb = b - y[i];
				//if (aa % x[n] == 0 && bb % y[n] == 0 && aa/x[n] == bb/y[n]) ok = true;
			/*	if ((x[n] == 0 && aa == 0) || (x[n] != 0 && aa % x[n] == 0)) {
					if ((y[n] == 0 && bb == 0) || (y[n] != 0 && bb % y[n] == 0)) {
						if (x[n] != 0 && y[n] != 0 && aa/x[n] != bb/y[n]) continue; 
						ok = true; 
						break; 
					}
				}*/

				if (x[n] != 0) {
					if (aa % x[n] != 0) continue; 
					int k = aa / x[n];
					if (k < 0 || k*y[n] != bb) continue;
					ok = true; 
					break; 
				}

				if (y[n] != 0) {
					if (bb % y[n] != 0) continue; 
					int k = bb / y[n];
					if (k<0 || k*x[n] != aa) continue;
					ok = true; 
					break; 
				}
				if (aa==0 && bb==0) {
					ok = true;
					break; 
				}
			}

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

		Long end = System.currentTimeMillis();
		out.close(); 
	}

	public static void main(String[] args) throws Exception {
		new Template().run(); 
	}
}