#include <bits/stdc++.h>
using namespace std;
const int maxn = 210;
int x[maxn], y[maxn];
int a, b, nx, ny, cnt, l, t1, t2, t;
char s[maxn];
void close() { exit(0); }
void init() {
  scanf("%d %d", &a, &b);
  if (a == 0 && b == 0) {
    printf("Yes\n");
    close();
  }
  scanf("%s", s);
  l = strlen(s);
  nx = 0;
  ny = 0;
  cnt = 1;
  x[cnt] = nx;
  y[cnt] = ny;
  for (int i = 0; i < l; i++) {
    cnt++;
    if (s[i] == 'U') {
      ny++;
    }
    if (s[i] == 'D') {
      ny--;
    }
    if (s[i] == 'R') {
      nx++;
    }
    if (s[i] == 'L') {
      nx--;
    }
    x[cnt] = nx;
    y[cnt] = ny;
    if (nx == a && ny == b) {
      printf("Yes\n");
      close();
    }
  }
  for (int i = 1; i <= cnt; i++) {
    if (nx == 0 && ny == 0) continue;
    if (ny != 0) {
      t = (b - y[i]) % ny;
      if (t != 0) continue;
      t = (b - y[i]) / ny;
    }
    if (nx != 0) {
      t = (a - x[i]) % nx;
      if (t != 0) continue;
      t = (a - x[i]) / nx;
    }
    if (x[i] + t * nx == a && y[i] + t * ny == b) {
      if (t < 0) continue;
      printf("Yes\n");
      close();
    }
  }
  printf("No\n");
}
int main() {
  init();
  close();
  return 0;
}
