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).
/*
 * Code Author: Jayesh Udhani
 * Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT ,Gandhinagar)
 */
import java.io.*;
import java.util.*;

public class Order {
	static ArrayList<Pair> al=new ArrayList<Pair>();
	static class Pair<F,S> {
		private int first;
		private int second;
		public Pair(int i, int j) { 
			this.first = i;
			this.second = j;
		}
		public int getFirst() { return first; }
		public int getSecond() { return second ;}
	}
	public static void main(String args[])
	{
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//----------My Code Starts Here----------
		int a,b,i,x=0,y=0,t=0,q1=-1,q2=-1;
		a=in.nextInt();
		b=in.nextInt();
		/*		q1= a>=0?(b>=0?1:4):(b>=0?2:3);
		if(a>0&&b==0)
			q1=5;
		if(a==0 && b>0)
			q1=6;
		if(a<0 && b==0)
			q1=7;
		if(a==0 && b<0)
			q1=8;
		if(a==0 && b==0)
			q1=9;	*/
		String str=in.next();
		for(i=0;i<str.length();i++)
		{
			if(str.charAt(i)=='U')
				y++;
			else if(str.charAt(i)=='D')
				y--;
			else if(str.charAt(i)=='L')
				x--;
			else
				x++;
			al.add(new Pair<>(x,y));
		}
		/*		q2= x>=0?(y>=0?1:4):(y>=0?2:3);
		if(x>0&&y==0)
			q2=5;
		if(x==0 && y>0)
			q2=6;
		if(x<0 && y==0)
			q2=7;
		if(x==0 && y<0)
			q2=8;
		if(x==0 && y==0)
			q2=9;	*/
//		System.out.println(x+" "+y);
		if(x==0 && y==0 && a==0 && b==0)
			t=1;
		if(x==0 && y!=0 && a==0 && (b+y)%y==0 && (long)b*y>=0)
			t=1;
		if(x!=0 && y==0 && (a+x)%x==0 && b==0 && (long)a*x>=0)
			t=1;
		if(x!=0 && y!=0 && (a+x)%x==0 && (b+y)%y==0 && (a+x)/x==(b+y)/y && (long)a*x>=0 && (long)b*y>=0)
			t=1;
		for(i=0;i<str.length()-1;i++)
		{
			if(str.charAt(i)=='U')
				y++;
			else if(str.charAt(i)=='D')
				y--;
			else if(str.charAt(i)=='L')
				x--;
			else
				x++;
			int p=al.get(i).first,q=al.get(i).second;
			int d1=x-p,d2=y-q;
			if(d1==0 && d2==0)
			{
				if(a==p && b==q)
					t=1;
			}
			else if(d1!=0 && d2==0)
			{
				if((a-(p-d1))%d1==0 && b==q && (long)(x-p)*(a-p)>=0)
					t=1;
			}
			else if(d1==0 && d2!=0)
			{
				if(a==p && (b-(q-d2))%d2==0 &&(long) (y-q)*(b-q)>=0)
					t=1;
			}
			else
			{
				if((a-(p-d1))%d1==0 && (b-(q-d2))%d2==0 && (a-(p-d1))/d1==(b-(q-d2))/d2 && (long)(x-p)*(a-p)>=0 &&(long) (y-q)*(b-q)>=0)
					t=1;
			}
		}
//		System.out.println(al.get(2).first+" "+al.get(2).second);
		//		if(q1!=q2)
		//			t=0;
//		System.out.println(q1+" "+q2);
		if(t==0)
			System.out.println("No");
		else
			System.out.println("Yes");
		out.close();
		//---------------The End———————————————————
	}
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine(){
			String fullLine=null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine=reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}
