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.awt.*;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {

    private static ArrayList<Point> buildPath(String program) {
        ArrayList<Point> path = new ArrayList<>(program.length());
        Point cur = new Point(0,0);
        path.add(new Point(cur));

        for (int i = 0; i < program.length(); i++) {
            char p = program.charAt(i);
            if (p == 'U') cur.y++;
            if (p == 'D') cur.y--;
            if (p == 'L') cur.x--;
            if (p == 'R') cur.x++;
            path.add(new Point(cur));
        }
        return path;
    }

    private static boolean tryProgramFromPoint(Point start, Point displacement, Point target) {
        // Cycle trajectory, no displacement
        if (displacement.equals(new Point(0, 0))) {
            return start.equals(target);
        }

        long startToTargetX = target.x - start.x;
        long startToTargetY = target.y - start.y;
        Point middle = new Point(start.x + displacement.x, start.y + displacement.y);

        // Three points lie on one line
        long part1 = startToTargetX * (middle.y - start.y);
        long part2 = startToTargetY * (middle.x - start.x);
        boolean lineCheck = (part1 == part2);

        // Target can be reached by integer number of repetitions
        long sqLen1 = startToTargetX * startToTargetX + startToTargetY * startToTargetY;
        long sqLen2 = displacement.x * displacement.x + displacement.y * displacement.y;
        boolean lengthCheck = (sqLen1 % sqLen2 == 0);

        // Direction is the right one
        boolean directCheck = (displacement.x * startToTargetX + displacement.y * startToTargetY > 0);

        return (start.equals(target) || lineCheck && lengthCheck && directCheck);
    }

    private static boolean checkIfRobotMeetsPoint(String program, Point target) {
        ArrayList<Point> path = buildPath(program);
        Point displacement = path.get(path.size() - 1);
        for (Point start : path) {
            if (tryProgramFromPoint(start, displacement, target)) return true;
        }
        return false;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        String program = in.next();

        boolean result = checkIfRobotMeetsPoint(program, new Point(a, b));
        String output = result == true ? "Yes" : "No";
        System.out.println(output);
    }

}
