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).
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
    long MOD = 1000000007L;
    int INF = 1000000001;
    public class Obj implements Comparable<Obj>{
        public int t;
        public int h;
        
        public Obj(int t_, int h_){
            t = t_;
            h = h_;
        }
        
        public int compareTo(Obj other){
            return t - other.t;
        }
        
    }
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
        Codechef cf = new Codechef();
        cf.Solve();
	}
	
	public void Solve(){
        MyScanner sc = new MyScanner();
        int a = sc.nextInt();
        int b = sc.nextInt();
        if (a == 0 && b == 0){
            System.out.println("Yes");
            return;
        }
        String s = sc.nextLine();
        char[] arr = s.toCharArray();
        int x = 0;
        int y = 0;
        for (char c : arr){
            if (c == 'U'){
                y++;
            }else if (c == 'D'){
                y--;
            }else if (c == 'L'){
                x--;
            }else if (c == 'R'){
                x++;
            }
        }
        
        int u = 0;
        int v = 0;
        if (ok(x, y, a, b)){
            System.out.println("Yes");
            return;
        }
        for (char c : arr){
            if (c == 'U'){
                v++;
            }else if (c == 'D'){
                v--;
            }else if (c == 'L'){
                u--;
            }else if (c == 'R'){
                u++;
            }
            // System.out.println(u + " " + v);
            int u1 = a - u;
            int v1 = b - v;
            if (u1 == 0 && v1 == 0){
                System.out.println("Yes");
                return;
            }
            if (ok(x, y, u1, v1)){
                System.out.println("Yes");
                return;
            }
        }
        
        System.out.println("No");
        
	}
	
	boolean ok(int x, int y, int u, int v){
	   // System.out.println("x: " + x + " y: " + y + " u: " + u + " v: " + v);
	    if (x == 0 && u != 0) return false;
	    if (y == 0 && v != 0) return false;
	    if (u == 0 && x == 0){
	        if (v == 0 && y == 0) return true;
	        return ((v%y == 0) && (v/y >= 0));
	    }
	    if (v == 0 && y == 0){
	        if (u == 0 && x == 0) return true;
	        return ((u%x == 0) && (u/x >= 0));
	    }
	    if ((u % x != 0) || (v % y != 0)) return false;
	    int k1 = u / x;
	    int k2 = v / y;
	   // System.out.println("k1: " + k1 + " k2: " + k2);
	    
	    if (k1 < 0 || k2 < 0 || (k1 != k2)) return false;
	    return true;
	}

	//-----------PrintWriter for faster output---------------------------------
   public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine(){
          String str = "";
      try {
         str = br.readLine();
      } catch (IOException e) {
         e.printStackTrace();
      }
      return str;
      }

   }
}
