#include <bits/stdc++.h>
using namespace std;
int main() {
  int tx, ty;
  cin >> tx >> ty;
  string s;
  cin >> s;
  int n = s.size();
  vector<int> px(n + 1), py(n + 1);
  int dx = 0, dy = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'U')
      ++dy;
    else if (s[i] == 'D')
      --dy;
    else if (s[i] == 'L')
      --dx;
    else if (s[i] == 'R')
      ++dx;
    px[i] = dx;
    py[i] = dy;
  }
  px[n] = py[n] = 0;
  ++n;
  bool status = (tx == 0 and ty == 0);
  double k;
  for (int i = 0; i < n; ++i)
    if (px[i] == tx and py[i] == ty) status = true;
  for (int i = 0; i < n; ++i) {
    if (dx != 0)
      k = double(tx - px[i]) / dx;
    else if (dy != 0)
      k = double(ty - py[i]) / dy;
    else
      k = 0;
    if (floor(k) == k and k >= 0 and dx * k + px[i] == tx and
        dy * k + py[i] == ty)
      status = true;
  }
  if (status)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}

### Prompt

Create a solution in cpp for the following problem:

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).

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int tx, ty;
  cin >> tx >> ty;
  string s;
  cin >> s;
  int n = s.size();
  vector<int> px(n + 1), py(n + 1);
  int dx = 0, dy = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'U')
      ++dy;
    else if (s[i] == 'D')
      --dy;
    else if (s[i] == 'L')
      --dx;
    else if (s[i] == 'R')
      ++dx;
    px[i] = dx;
    py[i] = dy;
  }
  px[n] = py[n] = 0;
  ++n;
  bool status = (tx == 0 and ty == 0);
  double k;
  for (int i = 0; i < n; ++i)
    if (px[i] == tx and py[i] == ty) status = true;
  for (int i = 0; i < n; ++i) {
    if (dx != 0)
      k = double(tx - px[i]) / dx;
    else if (dy != 0)
      k = double(ty - py[i]) / dy;
    else
      k = 0;
    if (floor(k) == k and k >= 0 and dx * k + px[i] == tx and
        dy * k + py[i] == ty)
      status = true;
  }
  if (status)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}

```