#include <bits/stdc++.h>
using namespace std;
const int OnlineJudge = 0;
const int maxn = 2222;
int x[maxn], y[maxn];
string s;
int n;
int a, b;
void ReadData() {
  cin >> a >> b;
  cin >> s;
  n = int(s.size());
}
void Process() {
  x[0] = y[0] = 0;
  for (int i = 0, _a = n; i < _a; i++) {
    x[i + 1] = x[i];
    y[i + 1] = y[i];
    if (s[i] == 'U') y[i + 1]++;
    if (s[i] == 'D') y[i + 1]--;
    if (s[i] == 'L') x[i + 1]--;
    if (s[i] == 'R') x[i + 1]++;
  }
  for (int _a = 0, _b = n, i = _a; i <= _b; i++) {
    int tx = a - x[i], ty = b - y[i];
    int kx = -1, ky = -2;
    bool okx = false, oky = false;
    if (x[n] == 0) {
      if (tx == 0) okx = true;
    } else if (tx % x[n] == 0 && 1LL * x[n] * tx >= 0) {
      okx = true;
      kx = tx / x[n];
    }
    if (y[n] == 0) {
      if (ty == 0) oky = true;
    } else if (ty % y[n] == 0 && 1LL * y[n] * ty >= 0) {
      oky = true;
      ky = ty / y[n];
    }
    if (okx && oky && (kx == ky || (x[n] == 0 || y[n] == 0))) {
      puts("Yes");
      return;
    }
  }
  puts("No");
}
int main() {
  std ::ios_base::sync_with_stdio(false);
  cin.tie(0);
  ReadData();
  Process();
  return 0;
}
