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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class CielRobot {

    private static void solve() {
        final int targetX = io.nextInt();
        final int targetY = io.nextInt();

        final String path = io.next().trim();

        if (goesThrough(targetX, targetY, path)) {
            io.printLine("Yes");
        } else {
            io.printLine("No");
        }
    }

    public static boolean goesThrough(final int targetX, final int targetY, final String path) {
        final List<int[]> steps = createSteps(path);
        final int[] length = steps.get(steps.size() - 1);

        for (final int[] step : steps) {
            final int distX = targetX - step[0];
            final int distY = targetY - step[1];

            if (step[0] == targetX && step[1] == targetY) {
                return true;
            }

            if (length[0] == 0 && length[1] == 0) {
                continue;
            } else if (length[0] == 0) {
                if (targetX == step[0] && distY % length[1] == 0 && distY / length[1] > 0) {
                    return true;
                }
            } else if (length[1] == 0) {
                if (targetY == step[1] && distX % length[0] == 0 && distX / length[0] > 0) {
                    return true;
                }
            } else {
                final int nx = distX / length[0];
                final int modX = distX % length[0];

                final int ny = distY / length[1];
                final int modY = distY % length[1];

                if (nx > 0 && ny > 0 && nx == ny && modX == 0 && modY == 0) {
                    return true;
                }
            }
        }

        return false;
    }

    private static List<int[]> createSteps(final String path) {
        int x = 0;
        int y = 0;

        final List<int[]> steps = new ArrayList<>();

        // Add origo
        steps.add(new int[] { x, y });

        for (final String move : path.split("")) {
            switch (move) {
            case "U":
                y++;
                break;
            case "D":
                y--;
                break;
            case "L":
                x--;
                break;
            case "R":
                x++;
                break;
            case "":
                continue;
            default:
                throw new RuntimeException(move);
            }
            steps.add(new int[] { x, y });
        }

        return steps;
    }

    private static IO io;

    public static void main(final String[] args) throws Exception {
        final IO inputOutput = new IO();
        try {
            io = inputOutput;
            solve();
        } finally {
            io.close();
        }
    }

    static class IO {
        private final PrintWriter out = new PrintWriter(System.out);
        private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        private StringTokenizer tokenizer;

        IO() {
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (final IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            try {
                return reader.readLine();
            } catch (final Exception e) {
                throw new RuntimeException(e);
            }
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

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

        void printLine(final Object... objects) {
            print(objects);
            out.println();
        }

        public void close() throws Exception {
            out.close();
            reader.close();
        }
    }
}
