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.util.*;
import java.io.*;
public class a {
    static long mod = 1000000007;
    static ArrayList<Integer>[] g;
public static void main(String[] args) throws IOException
{
    //Scanner input = new Scanner(new File("input.txt"));
    //PrintWriter out = new PrintWriter(new File("output.txt"));
    
    boolean[] primes = new boolean[10000001];
    for(int i = 0; i<primes.length; i++) primes[i] = true;
    primes[0] = false;
    primes[1] = false;
    for(int i = 2; i<primes.length; i++)
    {
        if(primes[i])
        {
            for(int j = 2*i; j < primes.length; j+=i)
                primes[j] = false;
        }
    }
    
    
  input.init(System.in);
  PrintWriter out  = new PrintWriter((System.out));
  int a = input.nextInt(), b = input.nextInt();
  String s = input.next();
  int dx = 0, dy = 0;
  for(int i = 0; i<s.length(); i++)
  {
      char c = s.charAt(i);
      if(c=='U') dy++;
      else if(c=='D') dy--;
      else if(c=='R') dx++;
      else dx--;
  }
  s = "."+s;
  boolean good = false;
  for(int i = 0; i<s.length(); i++)
  {
      char c = s.charAt(i);
      if(c=='U') b--;
      else if(c=='D') b++;
      else if(c=='R') a--;
      else if(c=='L') a++;
      if(a==0 && b==0) good = true;
      //out.println(a+" "+b+" "+dx+" "+dy);
      if(dx!=0 && a/dx < 0) continue;
      if(dy!=0 && b/dy < 0) continue;
      if(((a==0 && dx == 0) || (dx!= 0 && a%dx == 0)) && ((b==0 && dy ==0) || (dy!=0 &&b%dy==0)) && ((dx==0 || dy == 0) ||a/dx == b/dy)) good = true;
  }
  out.println(good?"Yes":"No");
  out.close();
}
static class Team implements Comparable<Team>
{
    String name;
    int scored, allowed, points;
    public Team(String n, int s, int a, int p)
    {
        name = n;
        scored = s;
        allowed = a;
        points = p;
    }
    @Override
    public int compareTo(Team that) {
        // TODO Auto-generated method stub
        if(this.points == that.points)
        {
            if(this.scored - this.allowed == that.scored - that.allowed)
                return that.scored - this.scored;
            else
                return that.scored - that.allowed - (this.scored - this.allowed);
        }
        else
            return that.points - this.points;
    }
}
static long pow (long a, long p)
{
    if(p==0) return 1;
    if((p&1) == 0)
    {
        long sqrt = pow(a, p/2);
        return (sqrt*sqrt)%mod;
    }
    return (a*pow(a,p-1))%mod;
}
static class input {
  static BufferedReader reader;
  static StringTokenizer tokenizer;

  /** call this method to initialize reader for InputStream */
  static void init(InputStream input) {
      reader = new BufferedReader(
                   new InputStreamReader(input) );
      tokenizer = new StringTokenizer("");
  }

  /** get next word */
  static String next() throws IOException {
      while ( ! tokenizer.hasMoreTokens() ) {
          //TODO add check for eof if necessary
          tokenizer = new StringTokenizer(
                 reader.readLine() );
      }
      return tokenizer.nextToken();
  }

  static int nextInt() throws IOException {
      return Integer.parseInt( next() );
  }
  
  static double nextDouble() throws IOException {
      return Double.parseDouble( next() );
  }
  static long nextLong() throws IOException {
      return Long.parseLong( next() );
  }
  static String nextLine() throws IOException {
    return reader.readLine();
  }
}
}