#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const double pi = acos(-1.0);
const int inf = (int)1e9;
const double eps = 1e-9;
const int ss = (int)1e6 + 3;
const int base = inf;
bool pred(const pair<int, int>& i, const pair<int, int>& j) {
  if (i.first == j.first) {
    return i.second > j.second;
  } else {
    return i.first > j.first;
  }
}
long long int gcd(long long int a, long long int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int main() {
  long long int a, b;
  string s;
  cin >> a >> b >> s;
  vector<pair<long long int, long long int> > z;
  int x, y;
  x = 0;
  y = 0;
  z.push_back(make_pair(x, y));
  for (int i = 0; i < s.size(); ++i) {
    if (s[i] == 'R') {
      ++x;
    }
    if (s[i] == 'L') {
      --x;
    }
    if (s[i] == 'U') {
      ++y;
    }
    if (s[i] == 'D') {
      --y;
    }
    z.push_back(make_pair(x, y));
  }
  pair<int, int> last = z.back();
  for (int i = 0; i < s.size(); ++i) {
    if (z[i] == make_pair(a, b)) {
      cout << "Yes";
      return 0;
    }
    if (last == make_pair(0, 0)) {
      if (z[i] == make_pair(a, b)) {
        cout << "Yes";
        return 0;
      }
    } else {
      if (last.first == 0) {
        long long int first = b - z[i].second;
        long long int second = last.second;
        long long int g = gcd(first, second);
        first /= g;
        second /= g;
        if (second == 1 && first >= 1 &&
            first * 1ll * last.first + z[i].first == a) {
          cout << "Yes";
          return 0;
        }
        continue;
      }
      if (last.second == 0) {
        long long int first = a - z[i].first;
        long long int second = last.first;
        long long int g = gcd(first, second);
        first /= g;
        second /= g;
        if (second == 1 && first >= 1 &&
            first * 1ll * last.second + z[i].second == b) {
          cout << "Yes";
          return 0;
        }
        continue;
      }
      long long int first = b - z[i].second;
      long long int second = last.second;
      long long int g = gcd(first, second);
      first /= g;
      second /= g;
      long long int now = first;
      if (second == 1) {
        first = a - z[i].first;
        second = last.first;
        g = gcd(first, second);
        first /= g;
        second /= g;
        if (second == 1 && first == now && first >= 1) {
          cout << "Yes";
          return 0;
        }
      }
    }
  }
  cout << "No";
  return 0;
}
