#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b;
  char s[101];
  scanf("%d%d%s", &a, &b, s);
  int n = strlen(s);
  int x[101], y[101];
  x[0] = 0;
  y[0] = 0;
  for (int i = 0; i < n; i++) {
    switch (s[i]) {
      case 'U':
        x[i + 1] = x[i];
        y[i + 1] = y[i] + 1;
        break;
      case 'D':
        x[i + 1] = x[i];
        y[i + 1] = y[i] - 1;
        break;
      case 'L':
        x[i + 1] = x[i] - 1;
        y[i + 1] = y[i];
        break;
      case 'R':
        x[i + 1] = x[i] + 1;
        y[i + 1] = y[i];
        break;
    }
  }
  if (x[n] == 0 && y[n] != 0) {
    swap(a, b);
    for (int i = 0; i <= n; i++) swap(x[i], y[i]);
  }
  for (int i = 0; i < n; i++) {
    int t1 = a - x[i];
    int t2 = b - y[i];
    if (x[n] == 0 && y[n] == 0) {
      if (t1 == 0 && t2 == 0) {
        printf("Yes");
        return 0;
      }
      continue;
    }
    if (t1 % x[n] != 0) continue;
    int k = t1 / x[n];
    if (k < 0) continue;
    if ((long long)k * y[n] == t2) {
      printf("Yes\n");
      return 0;
    }
  }
  printf("No\n");
  return 0;
}
