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.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.TreeSet;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author coderbd
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskA {
    public static class Point implements Comparable<Point> {
        public long x, y;
        public Point(long x, long y) {
            this.x = x;
            this.y = y;
        }
        public int compareTo(Point point) {
            if (this.x == point.x) {
                if (this.y < point.y)
                    return -1;
                if (this.y > point.y)
                    return 1;
                return 0;
            }
            if (this.x < point.x)
                return -1;
            return 1;
        }
    }
    public void solve(int testNumber, InputReader in, OutputWriter out) {
        long a = in.readInt();
        long b = in.readInt();
        char[] s = in.readLine().toCharArray();
        TreeSet<Point> set = new TreeSet<Point>();
        set.add(new Point(0L, 0L));
        long x = 0L;
        long y = 0L;
        for (int i = 0; i < s.length; i++) {
            if (s[i] == 'U')
                y++;
            if (s[i] == 'D')
                y--;
            if (s[i] == 'L')
                x--;
            if (s[i] == 'R')
                x++;
            set.add(new Point(x, y));
        }
        boolean flag = false;
        for (Point point : set) {
            long px = point.x;
            long py = point.y;
            long dx = a - px;
            long dy = b - py;
            if (x == 0L && y == 0L) {
                if (px == a && py == b) {
                    flag = true;
                    break;
                }
            }
            else if (x == 0L) {
                if (px == a && dy % y == 0L && dy / y >= 0L) {
                    flag = true;
                    break;
                }
            }
            else if (y == 0L) {
                if (py == b && dx % x == 0L && dx / x >= 0L) {
                    flag = true;
                    break;
                }
            }
            else if (dx % x == 0L && dy % y == 0L) {
                long xx = dx / x;
                long yy = dy / y;
                if (xx == yy && xx >= 0L) {
                    flag = true;
                    break;
                }
            }
        }
        out.printLine(flag ? "Yes" : "No");
    }
}

class InputReader {

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

    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 static boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    private String readLine0() {
        StringBuffer buf = new StringBuffer();
        int c = read();
        while (c != '\n' && c != -1) {
            if (c != '\r')
                buf.appendCodePoint(c);
            c = read();
        }
        return buf.toString();
    }

    public String readLine() {
        String s = readLine0();
        while (s.trim().length() == 0)
            s = readLine0();
        return s;
    }

    }

class OutputWriter {
    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public OutputWriter(Writer writer) {
        this.writer = new PrintWriter(writer);
    }

    public void print(Object...objects) {
        for (int i = 0; i < objects.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.print(objects[i]);
        }
    }

    public void printLine(Object...objects) {
        print(objects);
        writer.println();
    }

    public void close() {
        writer.close();
    }

    }

