#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b;
  scanf("%d %d", &a, &b);
  string s, crap;
  getline(cin, crap);
  getline(cin, s);
  if (a == 0 && b == 0) {
    printf("Yes");
    return 0;
  }
  s += s;
  s += s;
  s += s;
  s += s;
  s += s;
  s += s;
  long long i, len, x = 0, y = 0;
  len = s.length();
  int xneg = 0, xpos = 0, ypos = 0, yneg = 0;
  vector<pair<int, int> > pt;
  pt.push_back(make_pair(0, 0));
  for (i = 0; i < len; ++i) {
    if (x > 0) xpos = 1;
    if (y > 0) ypos = 1;
    if (x < 0) xneg = 1;
    if (y < 0) yneg = 1;
    if (s[i] == 'R')
      ++x;
    else if (s[i] == 'U')
      ++y;
    else if (s[i] == 'L')
      --x;
    else if (s[i] == 'D')
      --y;
    pt.push_back(make_pair(x, y));
  }
  long long p = INT_MAX, t = INT_MAX;
  if ((a < 0 && xneg == 0) && (yneg == 0 && b < 0)) {
    printf("No");
    return 0;
  }
  if ((a > 0 && xpos == 0) && (ypos == 0 && b > 0)) {
    printf("No");
    return 0;
  }
  if (x != 0) p = a / x;
  if (y != 0) t = b / y;
  p = min(p, t);
  if (x != 0) a -= p * x;
  if (y != 0) b -= p * y;
  vector<pair<int, int> >::iterator it;
  it = find(pt.begin(), pt.end(), pair<int, int>(a, b));
  if (it == pt.end())
    cout << "No";
  else
    cout << "Yes";
  return 0;
}
