#include <bits/stdc++.h>
using namespace std;
map<char, pair<int, int> > m;
int main() {
  m['U'] = make_pair(0, 1);
  m['D'] = make_pair(0, -1);
  m['R'] = make_pair(1, 0);
  m['L'] = make_pair(-1, 0);
  vector<pair<int, int> > all;
  int a, b;
  cin >> a >> b;
  int x = 0, y = 0;
  all.push_back(make_pair(x, y));
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    x += m[s[i]].first;
    y += m[s[i]].second;
    all.push_back(make_pair(x, y));
  }
  bool ans = false;
  int k;
  for (int i = 0; i < all.size(); i++) {
    if (x && y) {
      k = (a - all[i].first) / x;
      if (k * x == a - all[i].first && k * y == b - all[i].second && k >= 0)
        ans = true;
    } else if (x) {
      k = (a - all[i].first) / x;
      if (k * x == a - all[i].first && b == all[i].second && k >= 0) ans = true;
    } else if (y) {
      k = (b - all[i].second) / y;
      if (k * y == b - all[i].second && a == all[i].first && k >= 0) ans = true;
    } else {
      if (a == all[i].first && b == all[i].second) ans = true;
    }
  }
  if (ans)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
