#include <bits/stdc++.h>
using namespace std;
int x[144], y[144];
bool xmod(int ca, int a, int cb, int b) {
  if (ca == 0 && cb == 0) return true;
  int pa, pb;
  if (ca > 0 && a > 0)
    if (ca % a)
      return false;
    else
      pa = ca / a;
  if (ca > 0 && a <= 0) return false;
  if (ca == 0 && a) return false;
  if (ca == 0 && a == 0) pa = -1;
  if (ca < 0 && a >= 0) return false;
  if (ca < 0 && a < 0)
    if ((-ca) % (-a))
      return false;
    else
      pa = ca / a;
  if (cb > 0 && b > 0)
    if (cb % b)
      return false;
    else
      pb = cb / b;
  if (cb > 0 && b <= 0) return false;
  if (cb == 0 && b) return false;
  if (cb == 0 && b == 0) pb = -1;
  if (cb < 0 && b >= 0) return false;
  if (cb < 0 && b < 0)
    if ((-cb) % (-b))
      return false;
    else
      pb = cb / b;
  if ((pa ^ pb) && pa != -1 && pb != -1) return false;
  return true;
}
int main() {
  int a, b;
  cin >> a >> b;
  char s[144];
  cin >> s;
  int len = strlen(s), xx = 0, yy = 0;
  for (int i = 0; i < len; i++) {
    x[i] = xx, y[i] = yy;
    if (s[i] == 'U')
      yy += 1;
    else if (s[i] == 'D')
      yy -= 1;
    else if (s[i] == 'L')
      xx -= 1;
    else
      xx += 1;
  }
  bool fg = false;
  for (int i = 0; i < len; i++) {
    int ca = a - x[i];
    int cb = b - y[i];
    if (xmod(ca, xx, cb, yy)) {
      fg = true;
      break;
    }
  }
  if (xmod(a, xx, b, yy)) fg = true;
  puts(fg ? "Yes" : "No");
  return 0;
}
