#include <bits/stdc++.h>
using namespace std;
const int maxn = -1;
const int inf = 1e9;
vector<pair<long long, long long> > pos;
string s;
int main() {
  long long a, b, x, y, a1, b1, n;
  cin >> a >> b;
  cin >> s;
  n = s.length();
  x = y = 0;
  for (int i = 0; i < n; i++) {
    pos.push_back(make_pair(x, y));
    if (s[i] == 'U') y++;
    if (s[i] == 'D') y--;
    if (s[i] == 'L') x--;
    if (s[i] == 'R') x++;
  }
  for (int i = 0; i < (int)pos.size(); i++) {
    a1 = a - pos[i].first;
    b1 = b - pos[i].second;
    if (x == 0) {
      if (a1 != 0) continue;
      if (y == 0) {
        if (b1 != 0) continue;
        printf("Yes\n");
        return 0;
      }
      if (b1 % y == 0 && b1 / y >= 0) {
        printf("Yes\n");
        return 0;
      }
      continue;
    }
    if (a1 % x == 0 && a1 / x >= 0 && y * (a1 / x) == b1) {
      printf("Yes\n");
      return 0;
    }
  }
  printf("No\n");
  return 0;
}
