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.math.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;

public class Main
{    
   public static void main(String[] args) throws IOException
   {
      new Main().run();
   }

   StreamTokenizer in;
   PrintWriter out;
//deb////////////////////////////////////////////////
    public static void deb(String n ,Object n1){
     System.out.println(n+" is : "+n1);
 }  
    public static void deb(int[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
     public static void deb(long[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
      public static void deb(String[] A){
       
        for (Object oo : A) {
            System.out.print(oo+" ");
        }
        System.out.println("");
 }
      public static void deb(int[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
        public static void deb(long[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
          public static void deb(String[][] A){
          for (int i = 0; i < A.length; i++) {
               for (Object oo : A[i]) {
            System.out.print(oo+" ");
        }
        System.out.println("");
          }
       
 }
      /////////////////////////////////////////////////////////////
   int nextInt() throws IOException
   {
      in.nextToken();
      return (int)in.nval;
   }
   long nextLong() throws IOException
   {
      in.nextToken();
      return (long)in.nval;
   }
   
   void run() throws IOException
   {
  //   in = new StreamTokenizer(new BufferedReader(new FileReader("input.txt")));
    //  out = new PrintWriter(new FileWriter("output.txt"));
     in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
   out = new PrintWriter(new OutputStreamWriter(System.out));
      solve();
      out.flush();
   }
 


   void solve() throws IOException
   {     
       //   BufferedReader re= new BufferedReader(new FileReader("C:\\Users\\ASELA\\Desktop\\A.in"));
        //      BufferedReader re = new BufferedReader(new InputStreamReader(System.in));
          Scanner sc= new Scanner(System.in);
    int a=sc.nextInt(),b=sc.nextInt()   ;
    String S=sc.nextLine();
    S=sc.nextLine();
     //  System.out.println(S);
       int x=0,y=0;
       for (int i = 0; i < S.length(); i++) {
           char c=S.charAt(i);
           if(c=='U')y++;
           if(c=='D')y--;
           if(c=='R')x++;
           if(c=='L')x--;
           if(a==x&&b==y){
            System.out.println("Yes");
            return;
           }
           
      
        
       }
         if(a==0&&b==0){
            System.out.println("Yes");
            return;
        }  
      int tt2,tt1=a; 
      if(y!=0){tt2=b/y;
       tt2=max(0,tt2);
      int min=max(0,tt2-100),max=(tt2+100);
      
          for (int tt = min; tt <= max; tt++) {
              
          
       int xpos=tt*x,ypos=tt*y;
        if(a==xpos&&b==ypos){
            System.out.println("Yes");
            return;
           }
         for (int i = 0; i < S.length(); i++) {
           char c=S.charAt(i);
           if(c=='U')ypos++;
           if(c=='D')ypos--;
           if(c=='R')xpos++;
           if(c=='L')xpos--;
           if(a==xpos&&b==ypos){
            System.out.println("Yes");
            return;
           }}
          }
//             xpos=(tt+1)*x;ypos=(tt+1)*y;
//        if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }
//         for (int i = 0; i < S.length(); i++) {
//           char c=S.charAt(i);
//           if(c=='U')ypos++;
//           if(c=='D')ypos--;
//           if(c=='R')xpos++;
//           if(c=='L')xpos--;
//           if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }  }
      }
         if(x!=0){
//             tt1=a/x; 
//             int xpos=(tt1+1)*x,ypos=(tt1+1)*y;
//        if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }
//         for (int i = 0; i < S.length(); i++) {
//           char c=S.charAt(i);
//           if(c=='U')ypos++;
//           if(c=='D')ypos--;
//           if(c=='R')xpos++;
//           if(c=='L')xpos--;
//           if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }  }
//         
//         
//             xpos=(tt1)*x;ypos=(tt1)*y;
//        if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }
//         for (int i = 0; i < S.length(); i++) {
//           char c=S.charAt(i);
//           if(c=='U')ypos++;
//           if(c=='D')ypos--;
//           if(c=='R')xpos++;
//           if(c=='L')xpos--;
//           if(a==xpos&&b==ypos){
//            System.out.println("Yes");
//            return;
//           }  }
             tt2=a/x;
       tt2=max(0,tt2);
      int min=max(0,tt2-100),max=(tt2+100);
      
          for (int tt = min; tt <= max; tt++) {
              
          
       int xpos=tt*x,ypos=tt*y;
        if(a==xpos&&b==ypos){
            System.out.println("Yes");
            return;
           }
         for (int i = 0; i < S.length(); i++) {
           char c=S.charAt(i);
           if(c=='U')ypos++;
           if(c=='D')ypos--;
           if(c=='R')xpos++;
           if(c=='L')xpos--;
           if(a==xpos&&b==ypos){
            System.out.println("Yes");
            return;
           }}
          }
         }
         System.out.println("No");
         return;
       
   }}