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).
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.util.*;
/**
 *
 * @author Rohan
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    static LinkedList x,y;
    static String s;
    public static void main(String[] args) {
        // TODO code application logic here
        solve();
    }
    
    public static void solve(){
        InputReader in=new InputReader(System.in);
        PrintWriter out=new PrintWriter(System.out);
        
        long a=in.readLong(),b=in.readLong();
        s=in.next();
        
        x=new LinkedList(); y=new LinkedList();
        x.add(0L); y.add(0L);
        for(int i=0;i<s.length();i++){
            if(s.charAt(i)=='U'){
                x.add(x.getLast());
                y.add((Long)y.getLast()+1L);
            }
            if(s.charAt(i)=='D'){
                x.add(x.getLast());
                y.add((Long)y.getLast()-1L);
            }
            if(s.charAt(i)=='R'){
                x.add((Long)x.getLast()+1L);
                y.add(y.getLast());
            }
            if(s.charAt(i)=='L'){
                x.add((Long)x.getLast()-1L);
                y.add(y.getLast());
            }
        }
        
        
        long xl=(Long)x.getLast(),yl=(Long)y.getLast();
        boolean flag=false;
        for(int i=0;i<x.size();i++){
            long cx=(Long)x.get(i),cy=(Long)y.get(i);
            if(xl!=0 && yl!=0){
                long n1=(a-cx)/xl;
                long n2=(a-cx)%xl;
                long m1=(b-cy)/yl;
                long m2=(b-cy)%yl;
                if(n1==m1 && n2==m2 && n2==0 && n1>=0){
                    flag=true;
                    break;
                }
            }
            else if(yl!=0){
                long n1=a-cx;
                long m1=(b-cy)/yl;
                long m2=(b-cy)%yl;
                if(n1==0 && m2==0 && m1>=0){
                    flag=true;
                    break;
                }
            }
            else  if(xl!=0){
                long n1=(a-cx)/xl;
                long n2=(a-cx)%xl;
                long m1=(b-cy);
                if(n1>=0 && n2==0 && m1==0){
                    flag=true;
                    break;
                }
            }
            else{
                long n1=a-cx,m1=b-cy;
                if(n1==m1 && n1==0){
                    flag=true;
                    break;
                }
            }
        }
        if(flag) out.println("Yes");
        else out.println("No");
        out.flush(); out.close();
    }
}


class InputReader {

        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
                
                public long readLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            long sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }