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).
#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a + b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long mul(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a * b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
  long long res = 1LL;
  a = a % m;
  while (b) {
    if (b & 1) res = mul(res, a, m);
    b >>= 1;
    a = mul(a, a, m);
  }
  return res;
}
long long fastexp(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a;
    b >>= 1;
    a *= a;
  }
  return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtendido(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int modInverso(int a, int m) {
  int x, y;
  int g = gcdExtendido(a, m, &x, &y);
  if (g != 1)
    return -1;
  else
    return (x % m + m) % m;
}
const int N = 100 + 5;
int n;
int a, b;
int py[N];
int px[N];
char s[N];
int main() {
  scanf("%d %d", &(a), &(b));
  scanf("%s", s);
  n = strlen(s);
  for (int i = 1; i <= n; i++) {
    px[i] = px[i - 1];
    py[i] = py[i - 1];
    if (s[i - 1] == 'R')
      px[i] += 1;
    else if (s[i - 1] == 'U')
      py[i] += 1;
    else if (s[i - 1] == 'D')
      py[i] -= 1;
    else
      px[i] -= 1;
  }
  bool can = false;
  for (int i = 0; i <= n; i++) {
    int sumX = a - px[i];
    int sumY = b - py[i];
    bool act;
    if (px[n] == 0) {
      if (py[n] == 0) {
        if (sumX == 0 and sumY == 0) {
          act = true;
        } else
          act = false;
      } else {
        if (sumX == 0 and 1LL * sumY * py[n] >= 0) {
          if (abs(sumY) % abs(py[n]) == 0) {
            act = true;
          } else
            act = false;
        } else
          act = false;
      }
    } else {
      if (py[n] == 0) {
        if (sumY == 0 and sumX == 0) {
          act = true;
        } else {
          if (sumY == 0 and 1LL * sumX * px[n] >= 0) {
            if (abs(sumX) % abs(px[n]) == 0) {
              act = true;
            } else
              act = false;
          } else
            act = false;
        }
      } else {
        if (1LL * sumX * px[n] >= 0 and 1LL * sumY * py[n] >= 0) {
          if (abs(sumX) % abs(px[n]) == 0 and abs(sumY) % abs(py[n]) == 0) {
            if (sumX / px[n] == sumY / py[n])
              act = true;
            else
              act = false;
          } else
            act = false;
        } else
          act = false;
      }
    }
    can |= act;
  }
  puts(can ? "Yes" : "No");
  return 0;
}
