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

	static long xTotal = 0, yTotal = 0, xBound, yBound, signX, signY, a, b;
	static final int INF = (int) 1e9;

	static void add(char c) {
		if (c == 'U' || c == 'D')
			yTotal += map.get(c);
		else
			xTotal += map.get(c);

	}

	static boolean compare() {
		if (signX == 1 && signY == 1) {
			return (xBound >= a && yBound >= b);
		} else if (signX == 1 && signY == -1)
			return (xBound >= a && yBound <= b);

		else if (signX == -1 && signY == 1)
			return (xBound <= a && yBound > b);

		return (xBound <= a && yBound <= b);

	}

	static void assignSign() {

		if (a <= 0 && b <= 0) {
			signX = -1;
			signY = -1;
			xBound = INF;
			yBound = INF;

		} else if (a >= 0 && b <= 0) {
			signX = 1;
			signY = -1;
			xBound = -INF;
			yBound = INF;

		} else if (a <= 0 && b >= 0) {
			signX = -1;
			signY = 1;
			xBound = INF;
			yBound = -INF;

		} else if (a >= 0 && b >= 0) {
			signX = 1;
			signY = 1;
			xBound = -INF;
			yBound = -INF;

		}

		map.put('U', 1);
		map.put('D', -1);
		map.put('L', -1);
		map.put('R', 1);

	}

	static boolean canDoFirst(char[] c) {
		int x0 = 0;
		int y0 = 0;

		if (x0 == a && y0 == b)
			return true;
		for (int i = 0; i < 100; i++)
			for (char ch : c) {

				if (ch == 'U')
					y0++;
				else if (ch == 'D')
					y0--;
				else if (ch == 'R')
					x0++;
				else if (ch == 'L')
					x0--;
				if (x0 == a && y0 == b)
					return true;

			}
		return false;

	}

	static TreeMap<Character, Integer> map = new TreeMap<>();

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);

		a = sc.nextLong();
		b = sc.nextLong();
		char[] c = sc.next().toCharArray();

		if (canDoFirst(c)) {
			System.out.println("Yes");
			return;
		}

		assignSign();

		for (char ch : c)
			add(ch);

		long start = 0;
		long end = (long) 1e9;

		while (start <= end) {
			long mid = (start + end) >> 1l;
			boolean reachMaxBoth = false;

			long x0 = mid * xTotal;
			long y0 = mid * yTotal;
			xBound = x0;
			yBound = y0;
			reachMaxBoth |= compare();

			if (x0 == a && y0 == b) {
				System.out.println("Yes");
				return;
			}

			for (char ch : c) {

				if (ch == 'U')
					y0++;
				else if (ch == 'D')
					y0--;
				else if (ch == 'R')
					x0++;
				else if (ch == 'L')
					x0--;

				if (x0 == a && y0 == b) {
					System.out.println("Yes");
					return;
				}

				xBound = x0;
				yBound = y0;

				reachMaxBoth |= compare();

			}

			if (reachMaxBoth)
				end = mid - 1;
			else
				start = mid + 1;

		}

		System.out.println("No");

	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

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

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

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

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

		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}

}