#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b;
  while (cin >> a) {
    cin >> b;
    vector<pair<int, int> > move;
    string s;
    cin >> s;
    int n = s.size();
    int x = 0;
    int y = 0;
    for (int i = 0; i < n; i++) {
      if (s[i] == 'U') {
        y++;
      }
      if (s[i] == 'D') {
        y--;
      }
      if (s[i] == 'R') {
        x++;
      }
      if (s[i] == 'L') {
        x--;
      }
      move.push_back(make_pair(x, y));
    }
    int vx = move[n - 1].first;
    int vy = move[n - 1].second;
    bool hasSol = false;
    if (a == 0 && b == 0) {
      cout << "Yes" << endl;
      continue;
    }
    for (int i = 0; i < n; i++) {
      int tx = a - move[i].first;
      int ty = b - move[i].second;
      int kx = 0;
      if (vx != 0) {
        kx = tx / vx;
        if (kx < 0 || kx * vx != tx) {
          continue;
        }
      } else if (tx != 0) {
        continue;
      }
      int ky = 0;
      if (vy != 0) {
        ky = ty / vy;
        if (ky < 0 || ky * vy != ty) {
          continue;
        }
      } else if (ty != 0) {
        continue;
      }
      if (vx == 0 || vy == 0 || kx == ky) {
        hasSol = true;
        break;
      }
    }
    if (hasSol) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
