#include <bits/stdc++.h>
using namespace std;
long long int a, b, n, vx, vy;
string s1;
long long int s(long long int num) {
  if (num == 0) return 0;
  if (num < 0) return -1;
  if (num > 0) return 1;
}
bool solve(long long int x, long long int y) {
  long long int ca = a - x;
  long long int cb = b - y;
  if (s(vx) != s(ca) || s(vy) != s(cb)) {
    return 0;
  }
  long long int pa = abs(ca);
  long long int pb = abs(cb);
  long long int px = abs(vx);
  long long int py = abs(vy);
  if (px == 0) {
    if (pa == 0) {
      if (py == 0) {
        if (pb == 0) {
          return 1;
        } else {
          return 0;
        }
      } else {
        return pb % py == 0;
      }
    } else {
      return 0;
    }
  } else if (py == 0) {
    if (pb == 0) {
      return pa % px == 0;
    } else {
      return 0;
    }
  }
  return pa % px == 0 && pb % py == 0 && pa / px == pb / py;
}
int main() {
  cin >> a >> b;
  cin >> s1;
  n = s1.size();
  vector<pair<long long int, long long int> > v;
  for (long long int i = 0; i < n; i++) {
    if (vx == a && vy == b) {
      cout << "Yes\n";
      return 0;
    }
    if (s1[i] == 'U') {
      vy++;
    }
    if (s1[i] == 'D') {
      vy--;
    }
    if (s1[i] == 'R') {
      vx++;
    }
    if (s1[i] == 'L') {
      vx--;
    }
    v.push_back(make_pair(vx, vy));
  }
  v.push_back(make_pair(0, 0));
  for (long long int i = 0; i < (long long int)v.size(); i++) {
    if (solve(v[i].first, v[i].second)) {
      cout << "Yes\n";
      return 0;
    }
  }
  cout << "No\n";
  return 0;
}
