#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long inf = 10000000;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long modMul(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long modAdd(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long modSub(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, MOD - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void input(long long n, const long long a[], int co = 0) {
  long long i = 1;
  for (; i <= n; i++) {
  }
}
void dfs() {}
bool cmp() {}
const long long N = 1e5 + 5;
int X[105], Y[105];
void f(int x = 0) {
  if (x)
    cout << "No";
  else
    cout << "Yes";
  exit(0);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int x, y, a = 0, b = 0;
  string s;
  cin >> x >> y >> s;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'R')
      a++;
    else if (s[i] == 'L')
      a--;
    else if (s[i] == 'U')
      b++;
    else
      b--;
    X[i + 1] = a;
    Y[i + 1] = b;
  }
  for (int i = 0; i < s.size(); i++) {
    int tmx = x - X[i];
    int tmy = y - Y[i];
    if (tmx == 0 && tmy == 0) {
      f();
    } else if (a == 0) {
      if (tmx != 0) continue;
      if (b == 0) continue;
      if (tmy % b) continue;
      if (tmy / b <= 0) continue;
      f();
    } else if (b == 0) {
      if (tmy != 0) continue;
      if (a == 0) continue;
      if (tmx % a) continue;
      if (tmx / a <= 0) continue;
      f();
    } else {
      if (tmx % a or tmy % b) continue;
      if (tmx / a > 0 and tmy / b > 0 and tmx / a == tmy / b) f();
    }
  }
  f(1);
}

### Prompt

Generate a Cpp solution to 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;
const long long MOD = 1e9 + 7;
const long long inf = 10000000;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long modMul(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long modAdd(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long modSub(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, MOD - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void input(long long n, const long long a[], int co = 0) {
  long long i = 1;
  for (; i <= n; i++) {
  }
}
void dfs() {}
bool cmp() {}
const long long N = 1e5 + 5;
int X[105], Y[105];
void f(int x = 0) {
  if (x)
    cout << "No";
  else
    cout << "Yes";
  exit(0);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int x, y, a = 0, b = 0;
  string s;
  cin >> x >> y >> s;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'R')
      a++;
    else if (s[i] == 'L')
      a--;
    else if (s[i] == 'U')
      b++;
    else
      b--;
    X[i + 1] = a;
    Y[i + 1] = b;
  }
  for (int i = 0; i < s.size(); i++) {
    int tmx = x - X[i];
    int tmy = y - Y[i];
    if (tmx == 0 && tmy == 0) {
      f();
    } else if (a == 0) {
      if (tmx != 0) continue;
      if (b == 0) continue;
      if (tmy % b) continue;
      if (tmy / b <= 0) continue;
      f();
    } else if (b == 0) {
      if (tmy != 0) continue;
      if (a == 0) continue;
      if (tmx % a) continue;
      if (tmx / a <= 0) continue;
      f();
    } else {
      if (tmx % a or tmy % b) continue;
      if (tmx / a > 0 and tmy / b > 0 and tmx / a == tmy / b) f();
    }
  }
  f(1);
}

```