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 final class ceil_and_robot
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static int[] req,cnt;
	static int[][] pre;
	static char[] a;
	static int n;
	
	static void add(int idx)
	{
		if(a[idx]=='L')
			cnt[0]++;
		else if(a[idx]=='R')
			cnt[1]++;
		else if(a[idx]=='U')
			cnt[2]++;
		else
			cnt[3]++;
	}
	
	static boolean check(int x,int y,int idx)
	{
		int x1=(pre[idx][0]>0)?-pre[idx][0]:pre[idx][1],y1=(pre[idx][2]>0)?pre[idx][2]:-pre[idx][3];
		if(x1==x && y1==y)
		{
			return true;
		}
		int[] val=new int[4];val[0]=x<x1?Math.abs(x-x1):0;val[1]=x>x1?Math.abs(x-x1):0;val[2]=y>y1?Math.abs(y-y1):0;val[3]=y<y1?Math.abs(y-y1):0;
		for(int i=0;i<4;i++)
		{
			if(pre[n-1][i]>val[i])
			{
				return false;
			}
		}
		int mark=-1;
		for(int i=0;i<4;i++)
		{
			if(pre[n-1][i]==0 && val[i]==0)
			{
				continue;
			}
			if(pre[n-1][i]==0 && val[i]>0)
			{
				return false;
			}
			if(val[i]%pre[n-1][i]!=0)
			{
				return false;
			}
			else
			{
				if(mark==-1)
				{
					mark=val[i]/pre[n-1][i];
				}
				else if((val[i]/pre[n-1][i])!=mark)
				{
					return false;
				}
			}
		}
		return true;
	}
	
	public static void main(String args[]) throws Exception
	{
		int l=sc.nextInt(),r=sc.nextInt();a=sc.next().toCharArray();n=a.length;pre=new int[n][4];req=new int[4];cnt=new int[4];
		for(int i=0;i<n;i++)
		{
			add(i);
			pre[i][0]=Math.max(0,cnt[0]-cnt[1]);pre[i][1]=Math.max(pre[i][1],cnt[1]-cnt[0]);
			pre[i][2]=Math.max(0,cnt[2]-cnt[3]);pre[i][3]=Math.max(pre[i][3],cnt[3]-cnt[2]);
		}
		if(l==0 && r==0)
		{
			out.println("Yes");
		}
		else
		{
			boolean ans=false;
			for(int i=0;i<n;i++)
			{
				if(check(l,r,i))
				{
					ans=true;break;
				}
			}
			out.println(ans?"Yes":"No");
		}
		out.close();
	}
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}