#include <bits/stdc++.h>
using namespace std;
int main() {
  long long dx[120], dy[120], i, tot = 0, k = 0, a, b, len;
  string s;
  cin >> a >> b >> s;
  len = s.length();
  dx[0] = dy[0] = 0;
  for (i = 0; i < len; i++) {
    if (s[i] == 'U') {
      dx[++k] = dx[k - 1];
      dy[k] = dy[k - 1] + 1;
    } else if (s[i] == 'D') {
      dx[++k] = dx[k - 1];
      dy[k] = dy[k - 1] - 1;
    } else if (s[i] == 'R') {
      dx[++k] = dx[k - 1] + 1;
      dy[k] = dy[k - 1];
    } else if (s[i] == 'L') {
      dx[++k] = dx[k - 1] - 1;
      dy[k] = dy[k - 1];
    }
  }
  long long finalx = dx[k], finaly = dy[k];
  long long source = 10101;
  for (i = 0; i <= k; i++) {
    long long diff1 = a - dx[i];
    long long diff2 = b - dy[i];
    if (finalx)
      source = diff1 / finalx;
    else if (finaly)
      source = diff2 / finaly;
    else
      source = 1;
    if ((source >= 0) && (source * finalx == diff1) &&
        (source * finaly == diff2)) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No";
  return 0;
}
