#include <bits/stdc++.h>
using namespace std;
const long long N = 500010;
const long long MOD = 1e9 + 7;
long long n, h, w, len, ans;
char a[N];
long long lux, luy, rdx, rdy, tot;
struct Deleting {
  long long type;
  long long opes;
} del[N];
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
void Get_Move(long long &x, long long &y, char ch) {
  if (ch == 'L') x--;
  if (ch == 'R') x++;
  if (ch == 'U') y--;
  if (ch == 'D') y++;
}
signed main() {
  n = read(), h = read(), w = read();
  for (long long i = 1; i <= n; i++) cin >> a[i];
  lux = 1, luy = 1;
  rdx = w, rdy = h;
  for (long long i = 1; i <= n; i++) {
    Get_Move(lux, luy, a[i]);
    Get_Move(rdx, rdy, a[i]);
    if (lux > rdx || luy > rdy) break;
    if (!lux) lux = 1, ans = (ans + (rdy - luy + 1) * i % MOD) % MOD;
    if (rdx == w + 1) rdx = w, ans = (ans + (rdy - luy + 1) * i % MOD) % MOD;
    if (!luy) luy = 1, ans = (ans + (rdx - lux + 1) * i % MOD) % MOD;
    if (rdy == h + 1) rdy = h, ans = (ans + (rdx - lux + 1) * i % MOD) % MOD;
  }
  for (long long i = 1; i <= n; i++) {
    Get_Move(lux, luy, a[i]);
    Get_Move(rdx, rdy, a[i]);
    if (lux > rdx || luy > rdy) break;
    if (!lux) {
      lux = 1;
      ans = (ans + (i + n) * (rdy - luy + 1) % MOD) % MOD;
      tot++;
      del[tot].type = 0;
      del[tot].opes = i;
    }
    if (rdx == w + 1) {
      rdx = w;
      ans = (ans + (i + n) * (rdy - luy + 1) % MOD) % MOD;
      tot++;
      del[tot].type = 0;
      del[tot].opes = i;
    }
    if (!luy) {
      luy = 1;
      ans = (ans + (i + n) * (rdx - lux + 1) % MOD) % MOD;
      tot++;
      del[tot].type = 1;
      del[tot].opes = i;
    }
    if (rdy == h + 1) {
      rdy = h;
      ans = (ans + (i + n) * (rdx - lux + 1) % MOD) % MOD;
      tot++;
      del[tot].type = 1;
      del[tot].opes = i;
    }
  }
  if (!tot && lux <= rdx && luy <= rdy) puts("-1"), exit(0);
  long long rounds = 1, xlen = rdx - lux + 1, ylen = rdy - luy + 1;
  while (rounds++) {
    if (!xlen || !ylen) break;
    for (long long i = 1; i <= tot; i++) {
      if (del[i].type && xlen > 0 && ylen > 0) {
        ans = (ans + xlen * ((rounds * n) % MOD + del[i].opes) % MOD) % MOD;
        ylen--;
      }
      if (!del[i].type && xlen > 0 && ylen > 0) {
        ans = (ans + ylen * ((rounds * n) % MOD + del[i].opes) % MOD) % MOD;
        xlen--;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
