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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;



    
    
public class Solution  {
    
    static class FastScanner{
        BufferedReader s;
        StringTokenizer st;
        
        
        public FastScanner(){
            st = new StringTokenizer("");
            s = new BufferedReader(new InputStreamReader(System.in));
        }
        
        public FastScanner(File f) throws FileNotFoundException{
            st = new StringTokenizer("");
            s = new BufferedReader (new FileReader(f));
        }
        
        public int nextInt() throws IOException{
            if(st.hasMoreTokens())
                return Integer.parseInt(st.nextToken());
            else{
                st = new StringTokenizer(s.readLine());
                return nextInt();
            }
        }
        
        public double nextDouble() throws IOException{
            if(st.hasMoreTokens())
                return Double.parseDouble(st.nextToken());
            else{
                st = new StringTokenizer(s.readLine());
                return nextDouble();
            }
        }
        
        public long nextLong() throws IOException{
            if(st.hasMoreTokens())
                return Long.parseLong(st.nextToken());
            else{
                st = new StringTokenizer(s.readLine());
                return nextLong();
            }
        }
        
        public String nextString() throws IOException{
            if(st.hasMoreTokens())
                return st.nextToken();
            else{
                st = new StringTokenizer(s.readLine());
                return nextString();
            }
            
        }
        public String readLine() throws IOException{
            return s.readLine();
        }
        
        public void close() throws IOException{
            s.close();
        }
        
    }
    
    
    
    
    //FastScanner s = new FastScanner(new File("input.txt"));       copy inside void solve
    //PrintWriter ww = new PrintWriter(new FileWriter("output.txt"));
    static FastScanner s = new FastScanner();   
    static PrintWriter ww = new PrintWriter(new OutputStreamWriter(System.out));
    
    public static void main(String args[])throws IOException{
        //Main ob=new Main();
        Solution ob=new Solution();
        ob.solve();
            ww.close();
    }
    int max=Integer.MIN_VALUE;
    int MAX_T = (int) (1e2) + 7;
    int MAX_V = (int) (1e3) + 7;
    int dp[][]=new int[MAX_T][MAX_V<<1];
    boolean mar[][]=new boolean[MAX_T][MAX_V<<1];
    int shift=MAX_V;
    int org;
    /////////////////////////////////////////////
    
    /*
    int f(int u,int v,int t,int d,int sum,int cnt){
        
        if(mar[cnt][u+shift])
            return dp[cnt][u+shift];
        
        int max=Integer.MIN_VALUE;
        
        
        if (cnt == org - 1) {
                if((u - d <= v && v <= u + d))
                    max= v;
                else
                    max=max;
        }
        else{
        for(int i=-d;i<=d;i++){
            max=Math.max(max,f(u+i,v,t,d,sum+(u+i),cnt+1));
        }
        }
        max+=v;
        System.out.println(max+" "+(sum+v));
        dp[cnt][u+shift]=max;
        mar[cnt][u+shift]=true;
        return max;
    }
    */
    int gcd(int a,int b){
        if(b==0)
            return a;
        return gcd(b,a%b);
    }
    long modulo(long a,long b,long mod)
    {
        long x=1,y=a,i;
        for(i=0;i<b;i++)
        {
            y=(y*y)%mod;
        }
        x=(x*y)%mod;
        y=(y*y)%mod;
        return x%mod;
    }
    /////////////////////////////////////////////
    void solve() throws IOException {
        /*int u=s.nextInt();
        int v=s.nextInt();
        int t=s.nextInt();
        int d=s.nextInt();
        org=t;
        f(u,v,t,d,u,1);
        ww.println(max);
        */
        int a=s.nextInt();
        int b=s.nextInt();
        String str=s.nextString();
        int len=str.length();
        int dx=0;
        int dy=0;
        
        for(int i=0;i<len;i++){
            if(str.charAt(i)=='R')
                dx++;
            else if(str.charAt(i)=='L')
                dx--;
            else if(str.charAt(i)=='U')
                dy++;
            else
                dy--;
        }
        
        int kx1 = 0; int ky1 = 0;
        if(dx == 0) kx1 = 0; else kx1 = Math.abs(a/dx);
        
        if(dy == 0) ky1 = 0; else ky1 = Math.abs(b/dy);
    
        
 //     int k[]={kx1,kx2,kx1-1,kx1+1,kx2+1,kx2-1,ky1,ky2,ky1+1,ky1-1,ky2-1,ky2+1};
        long[] k = new long[100];
        int count = 0;
        for(int i=kx1-20;i<=kx1+20;i++) k[count++] = i;
        for(int i=ky1-20;i<=ky1+20;i++) k[count++] = i;
        
        long xx = 0;
        long yy = 0;
        
 //     System.out.println(dx+" "+dy);
        
        for(int i=0;i<k.length;i++){
            if(k[i]<0)
                continue;
            xx=0;
            xx+=(k[i]*dx);
            yy=0;
            yy+=(k[i]*dy);
            if((xx==a)&&(yy==b)){
                ww.println("Yes");
                return;
            }
            for(int j=0;j<len;j++){
                if(str.charAt(j)=='R')
                    xx++;
                else if(str.charAt(j)=='L')
                    xx--;
                else if(str.charAt(j)=='U')
                    yy++;
                else
                    yy--;
                
                if((xx==a)&&(yy==b)){
                    ww.println("Yes");
                    return;
                }
            }
        }
        
        ww.println("No");
        
    }//solve
  }