#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
typedef struct node {
  long long u, r;
} nd;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long a, b;
  cin >> a >> b;
  if (a == 0 && b == 0) {
    cout << "Yes";
    return 0;
  }
  string s;
  cin >> s;
  long long n = s.size();
  vector<nd> v(n);
  long long up = 0, right = 0;
  for (long long i = 0; i < n; i++) {
    if (s[i] == 'U') {
      up++;
    } else if (s[i] == 'R') {
      right++;
    } else if (s[i] == 'D') {
      up--;
    } else {
      right--;
    }
    v[i].u = up;
    v[i].r = right;
    if (up == b && right == a) {
      cout << "Yes";
      return 0;
    }
  }
  if (up == 0 && right == 0) {
    cout << "No";
    return 0;
  }
  for (long long i = 0; i < n; i++) {
    long long kup = b - v[i].u;
    if (up == 0) {
      if (v[i].u == b) {
        if ((a - v[i].r) % right == 0) {
          long long st = (a - v[i].r) / right;
          if (st < 0) {
            continue;
          }
          cout << "Yes";
          return 0;
        }
      }
      continue;
    }
    if ((b - v[i].u) % up != 0) {
      continue;
    }
    long long k = kup / up;
    if (k < 0) {
      continue;
    }
    long long stb = v[i].r + k * right;
    if (stb == a) {
      cout << "Yes";
      return 0;
    }
  }
  cout << "No";
  return 0;
}
