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.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;

public class Main1 {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner(System.in);
		
		int endX = sc.nextInt();
		int endY = sc.nextInt();
		String moves = sc.next();
		int N = moves.length();
		
		//FIND OFFSET IN EACH CYCLE
		int offsetX = 0;
		int offsetY = 0;
		for(char c : moves.toCharArray()){
			if(c == 'U') offsetY++;
			else if(c == 'D') offsetY--;
			else if(c == 'L') offsetX--;
			else offsetX++;
		}
		
		//check for every move
		int currentX = 0;
		int currentY = 0;
		for(int i = 0; i<=N; i++){			
			if(offsetX == 0){
				if(currentX == endX){
					//x is reached, check for y
					if(offsetY == 0){
						if(currentY == endY){
							//x and y are reached
							System.out.println("Yes");
							System.exit(0);
						}
					}
					else{
						if(Math.abs(endY - currentY) % Math.abs(offsetY) == 0){
							//coefficient is a full number, check sign
							int n = (endY - currentY) / offsetY;
							if(n >= 0){
								System.out.println("Yes");
								System.exit(0);
							}
						}
					}
				}
			}
			else{
				//offsetX != 0
				if(Math.abs(endX - currentX) % Math.abs(offsetX) == 0){
					//coefficient is a full number, check sign
					int n = (endX - currentX) / offsetX;
					if(n >= 0){
						//coefficient is valid, check for y
						int tmpY = n*offsetY + currentY;
						if(tmpY == endY){
							//goal reached
							System.out.println("Yes");
							System.exit(0);
						}
					}
				}
			}
			
			if(i < N){
				char c = moves.charAt(i);
				if(c == 'U') currentY++;
				else if(c == 'D') currentY--;
				else if(c == 'L') currentX--;
				else currentX++;
			}
		}
		System.out.println("No");
	}
}

class FastScanner {
	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public FastScanner(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String next() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public String nextLine() {
		int c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isLineEndChar(c));
		return res.toString();
	}

	public double nextDouble() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		double res = 0;
		while (!isSpaceChar(c) && c != '.') {
			if (c == 'e' || c == 'E')
				return res * Math.pow(10, nextInt());
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		}
		if (c == '.') {
			c = read();
			double m = 1;
			while (!isSpaceChar(c)) {
				if (c == 'e' || c == 'E')
					return res * Math.pow(10, nextInt());
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				m /= 10;
				res += (c - '0') * m;
				c = read();
			}
		}
		return res * sgn;
	}

	public long nextLong() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public boolean isLineEndChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == '\n' || c == '\r' || c == -1;
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}