#include <bits/stdc++.h>
using namespace std;
char BUFFER[100000 + 5];
bool readn(int &n) { return scanf("%d", &n) == 1; }
bool readl(long long &n) { return scanf("%I64d", &n) == 1; }
bool readd(double &n) { return scanf("%lf", &n) == 1; }
bool reads(string &s) {
  s = "";
  int n = scanf("%s", BUFFER);
  if (n == 1) s = BUFFER;
  return n == 1;
}
bool readln(string &s) {
  char *valid = gets(BUFFER);
  if (valid) s = BUFFER;
  return ((bool)valid);
}
void Print(long long &n, bool printNewLine = true) {
  printNewLine ? printf("%I64d\n", n) : printf("%I64d", n);
}
const int maxn = 1e9;
string s;
long long Abs(long long n) {
  if (n < 0) return -n;
  return n;
}
bool found() {
  long long i, k, a, b, dx, dy, dd, d, d1, d2, td;
  cin >> a >> b;
  string t;
  cin >> t;
  s = t;
  if (a == 0 && b == 0) return true;
  long long x1 = 0, y1 = 0, x2, y2;
  for (i = 0; i < ((int)s.size()); ++i) {
    if (s[i] == 'U')
      y1++;
    else if (s[i] == 'D')
      y1--;
    else if (s[i] == 'L')
      x1--;
    else
      x1++;
    if (x1 == a && y1 == b) return true;
  }
  if (x1 == 0 && y1 == 0) return false;
  d = Abs(x1) + Abs(y1);
  td = Abs(a) + Abs(b);
  k = td / d;
  if (k > ((int)s.size())) {
    k -= ((int)s.size());
    x1 += x1 * k;
    y1 += y1 * k;
  }
  for (k = 0; k < ((int)s.size()); ++k) {
    for (i = 0; i < ((int)s.size()); ++i) {
      if (x1 == a && y1 == b) return true;
      if (s[i] == 'U')
        y1++;
      else if (s[i] == 'D')
        y1--;
      else if (s[i] == 'L')
        x1--;
      else
        x1++;
    }
  }
  return false;
}
int main() {
  if (found())
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
