#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double EPS = 1e-6;
const int INF = 0x3fffffff;
const long long LINF = INF * 1ll * INF;
const double PI = acos(-1.0);
using namespace std;
bool vis[205][205];
int main(void) {
  int a, b;
  cin >> a >> b;
  string s;
  cin >> s;
  int x = 0, y = 0;
  vis[100][100] = 1;
  for (int i = 0; s[i]; i++) {
    if (s[i] == 'R')
      x++;
    else if (s[i] == 'L')
      x--;
    else if (s[i] == 'D')
      y--;
    else
      y++;
    vis[100 + x][100 + y] = true;
  }
  for (int i = 0; i <= 200; i++)
    for (int j = 0; j <= 200; j++) {
      if (vis[i][j]) {
        long long dx = i - 100, dy = j - 100;
        dx = a - dx, dy = b - dy;
        if (x == 0) {
          if (y == 0) {
            if (dx == dy && dx == 0) {
              cout << "Yes" << endl;
              return 0;
            }
          } else if (dx == 0 && dy % y == 0 && 1ll * dy * y >= 0) {
            cout << "Yes" << endl;
            return 0;
          }
        } else if (1ll * dx * y == 1ll * dy * x && dx % x == 0 &&
                   1ll * dx * x >= 0) {
          cout << "Yes" << endl;
          return 0;
        }
      }
    }
  cout << "No" << endl;
}
