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

public class Main {

	int tx, ty;

	void solve() {

		String yes = "Yes";
		String no = "No";

		tx = sc.nextInt();
		ty = sc.nextInt();
		char[] command = sc.next().toCharArray();
		int n = command.length;

		if (tx == 0 && ty == 0) {
			out.println(yes);
			return;
		}

		long[] v = new long[] { 0, 0 };
		for (int i = 0; i < n; i++) {
			sim(command[i], v);
			if (v[0] == tx && v[1] == ty) {
				out.println(yes);
				return;
			}
		}
		if (v[0] == 0 && v[1] == 0) {
			out.println(no);
			return;
		}

		long vx = v[0];
		long vy = v[1];

		long p = (tx * vx + ty * vy) / (vx * vx + vy * vy);
		for (long k = Math.max(0, p - n - n); k <= p + n + n; k++) {
			long[] w = new long[] { v[0] * k, v[1] * k };

			for (int i = 0; i < n; i++) {
				sim(command[i], w);
				if (w[0] == tx && w[1] == ty) {
					out.println(yes);
					return;
				}
			}

		}

		out.println(no);
		return;

	}

	void sim(char dir, long[] pos) {
		switch (dir) {
		case 'U': pos[1]++; break;
		case 'D': pos[1]--; break;
		case 'L': pos[0]--; break;
		case 'R': pos[0]++; break;
		}
	}

	class V extends ArrayList<V> {
		int dist = -1;
		char ch;

		void dfs(int dist, V prev) {
			this.dist = dist;
			for (V next : this) if (prev != next) {
				next.dfs(dist + 1, this);
			}
		}

		void paint(int count, V prev) {
			this.ch = (char)('Z' - Integer.numberOfTrailingZeros(count));
			for (V next : this) if (prev != next) {
				next.paint(count + 1, this);
			}

		}
	}

	public static void main(String[] args) throws Exception {
		Class<?> here = new Object(){}.getClass().getEnclosingClass();
		try {
			String packageName = here.getPackage().getName();
			packageName = "src/" + packageName.replaceAll("\\.", "/") + "/";
			System.setIn(new FileInputStream(packageName + "input.txt"));
//			System.setOut(new PrintStream(new FileOutputStream(packageName + "output.txt")));
		} catch (FileNotFoundException e) {
		} catch (NullPointerException e) {
		}

		Object o = Class.forName(here.getName()).newInstance();
		o.getClass().getMethod("run").invoke(o);
	}

	static void tr(Object... os) {
		System.err.println(deepToString(os));
	}

	MyScanner sc = null;
	PrintWriter out = null;
	public void run() throws Exception {
		sc = new MyScanner(System.in);
		out = new PrintWriter(System.out);
		for (;sc.hasNext();) {
			solve();
			out.flush();
		}
		out.close();
	}

	void print(int[] a) {
		out.print(a[0]);
		for (int i = 1; i < a.length; i++) out.print(" " + a[i]);
		out.println();
	}

	class MyScanner {
		String line;
		BufferedReader reader;
		StringTokenizer tokenizer;

		public MyScanner(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}
		public void eat() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					line = reader.readLine();
					if (line == null) {
						tokenizer = null;
						return;
					}
					tokenizer = new StringTokenizer(line);
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
		}
		public String next() {
			eat();
			return tokenizer.nextToken();
		}
		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		public boolean hasNext() {
			eat();
			return (tokenizer != null && tokenizer.hasMoreElements());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}
	}
}
