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.math.*;
import java.util.*;

//Codeforces
public class MainCodeforces1 {
	private static MyScanner in;
	private static PrintStream out;
	private static boolean LOCAL_TEST = false;

	private static void solve() throws IOException
	{
		int a = in.nextInt();
		int b = in.nextInt();
		String s = in.nextString();
		int dx = 0;
		int dy = 0;
		for (int i = 0; i < s.length(); i++) {
			char c = s.charAt(i);
			if (c == 'L')
				dx--;
			else if (c == 'R')
				dx++;
			else if (c == 'D')
				dy--;
			else if (c == 'U')
				dy++;
		}
		int repx = 0;
		if (dx != 0)
			repx = a / dx;
		int repy = 0;
		if (dy != 0)
			repy = b / dy;
		int rep = Math.max(repx, repy) - 100;
		if (rep < 0)
			rep = 0;
		int px = rep * dx;
		int py = rep * dy;
		boolean located = false;
		for (int k = 0; k < 200; k++) {
			for (int i = 0; i < s.length(); i++) {
				char c = s.charAt(i);
				if (c == 'L')
					px--;
				else if (c == 'R')
					px++;
				else if (c == 'D')
					py--;
				else if (c == 'U')
					py++;
				if (px == a && py == b)
					located = true;
			}
		}
		if (a == 0 && b == 0)
			located = true;
		if (located)
			out.println("Yes");
		else
			out.println("No");
	}

	public static void main(String[] args) throws IOException {
		// helpers for input/output
		out = System.out;
		try {
			String cname = System.getenv("COMPUTERNAME");
			if (!cname.equals(""))
				LOCAL_TEST = true;
		} catch (Exception e) {
		}
		if (LOCAL_TEST) {
			in = new MyScanner("E:\\zin.txt");
		}
		else {
			boolean usingFileForIO = false;
			if (usingFileForIO) {
				// using input.txt and output.txt as I/O
				in = new MyScanner("input.txt");
				out = new PrintStream("output.txt");
			}
			else {
				in = new MyScanner();
				out = System.out;
			}
		}

		solve();
	}

	// =====================================
	static class MyScanner {
		BufferedReader bufReader;
		StringTokenizer strTok;

		public MyScanner() throws IOException
		{
			bufReader = new BufferedReader(new InputStreamReader(System.in));
			strTok = new StringTokenizer("");
		}

		public MyScanner(String inputFile) throws IOException {
			bufReader = new BufferedReader(new InputStreamReader(new FileInputStream(
					inputFile)));
			strTok = new StringTokenizer("");
		}

		String GetNextToken() throws IOException {
			if (!strTok.hasMoreTokens())
				strTok = new StringTokenizer(bufReader.readLine());
			return strTok.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.valueOf(GetNextToken());
		}

		public long nextLong() throws IOException {
			return Long.valueOf(GetNextToken());
		}

		public double nextDouble() throws IOException {
			return Double.valueOf(GetNextToken());
		}

		public String nextString() throws IOException {
			return GetNextToken();
		}

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

		public int countTokens() {
			return strTok.countTokens();
		}

		public boolean hasMoreTokens() {
			return strTok.hasMoreTokens();
		}
	}

}