#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = 1e-6;
const int infi = (int)1e9;
const long long infl = (long long)1e16;
const int MOD = (int)1e9 + 7;
const int MAX = (int)5e5 + 10;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
const int dy[] = {0, 0, -1, 1, 1, -1, 1, -1, 0};
long long dot(long long x, long long y, long long xx, long long yy) {
  return x * yy + xx * y;
}
int main() {
  long long a, b;
  cin >> a >> b;
  string s;
  cin >> s;
  long long x = 0, y = 0;
  for (int i = 0; i < (int)s.size(); i++) {
    if (x == a && y == b) {
      cout << "Yes\n";
      return 0;
    }
    if (s[i] == 'U') y++;
    if (s[i] == 'D') y--;
    if (s[i] == 'R') x++;
    if (s[i] == 'L') x--;
    if (x == a && y == b) {
      cout << "Yes\n";
      return 0;
    }
  }
  long long tx = x, ty = y;
  long long xx = 0, yy = 0;
  for (int i = 0; i < (int)s.size(); i++) {
    if (s[i] == 'U') yy++;
    if (s[i] == 'D') yy--;
    if (s[i] == 'R') xx++;
    if (s[i] == 'L') xx--;
    if (tx == 0 && ty != 0) {
      if ((b - yy) % ty == 0) {
        long long k = (b - yy) / ty;
        if (k >= 0 && xx + k * tx == a) {
          cout << "Yes\n";
          return 0;
        }
      }
    } else if (tx != 0 && ty == 0) {
      if ((a - xx) % tx == 0) {
        long long k = (a - xx) / tx;
        if (k >= 0 && yy + k * ty == b) {
          cout << "Yes\n";
          return 0;
        }
      }
    } else if (ty == 0 && tx == 0) {
      if (a == xx && b == yy) {
        cout << "Yes\n";
        return 0;
      }
    } else {
      if ((a - xx) % tx == 0) {
        long long k = (a - xx) / tx;
        if (k >= 0 && yy + k * ty == b) {
          cout << "Yes\n";
          return 0;
        }
      }
    }
  }
  cout << "No\n";
  return 0;
}
