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 CF {
	static long X,Y;
	public static void main(String[] args) {
		FasterScanner sc = new FasterScanner();
		X = sc.nextInt();
		Y = sc.nextInt();
		long cx = 0;
		long cy = 0;
		String S = sc.next();
		long dx = 0;
		long dy = 0;
		for(int a=0;a<S.length();a++){
			if(S.charAt(a)=='L')dx--;
			else if(S.charAt(a)=='R')dx++;
			else if(S.charAt(a)=='U')dy++;
			else if(S.charAt(a)=='D')dy--;
		}
		boolean flag = false;
		
		
		flag |= cando(cx,dx,cy,dy);

		
		
		for(int a=0;a<S.length();a++){
			if(S.charAt(a)=='L')cx--;
			else if(S.charAt(a)=='R')cx++;
			else if(S.charAt(a)=='U')cy++;
			else if(S.charAt(a)=='D')cy--;
			flag |= cando(cx,dx,cy,dy);
			if(flag)break;
		//	System.out.println(flag +" "+cx+" "+cy+" "+X+" "+Y+" "+dx+" "+dy);
		}
		System.out.println(flag?"Yes":"No");
	}

	private static boolean cando(long cx, long dx, long cy, long dy) {
		if(cx==X&&cy==Y)return true;
		long DX = X-cx;
		long DY = Y-cy;
		long K = 0;
		if(DX!=0&&dx!=0){
			K = DX/dx;
		}
		else if(DY!=0&&dy!=0){
			K = DY/dy;
		}
		K--;
//		System.out.println(DX+" "+DY+" "+dx+" "+dy+" "+K);
		if(K>=0)if(cx+dx*K==X&&cy+dy*K==Y)return true;
		K++;
		if(K>=0)if(cx+dx*K==X&&cy+dy*K==Y)return true;
		K++;
		if(K>=0)if(cx+dx*K==X&&cy+dy*K==Y)return true;
		
		return false;
	}
	static class FasterScanner{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		
		public FasterScanner(){
			stream = System.in;
			//stream = new FileInputStream(new File("dec.in"));

		}
		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++];
		}
		
		boolean isSpaceChar(int c){
			return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
		}
		boolean isEndline(int c){
			return c=='\n'||c=='\r'||c==-1;
		}
		int nextInt(){
			return Integer.parseInt(next());
		}
		long nextLong(){
			return Long.parseLong(next());
		}
		double nextDouble(){
			return Double.parseDouble(next());
		}
		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();
		}
		String nextLine(){
			int c = read();
			while(isEndline(c))
				c=read();
			StringBuilder res = new StringBuilder();
			do{
				res.appendCodePoint(c);
				c = read();
			}while(!isEndline(c));
			return res.toString();
		}
		
	}

}
