#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 100;
int l[2];
long long m[2][N], dp[2][N];
int dir[2] = {-1, 1};
char s[N];
long long getmin(long long x, long long y) {
  if (x == -1) return y;
  if (y == -1) return x;
  if (x < y) return x;
  return y;
}
long long mod = 1e9 + 7;
int main() {
  int n;
  scanf("%d%d%d%s", &n, l, l + 1, s);
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'U') m[0][i] = -1;
    if (s[i] == 'D') m[0][i] = 1;
    if (s[i] == 'L') m[1][i] = -1;
    if (s[i] == 'R') m[1][i] = 1;
  }
  for (int tt = 0; tt < 2; ++tt) {
    int now = 0;
    for (int i = 0; i < n; ++i) {
      now = now + m[tt][i];
      if (now > 0 && l[tt] - now >= 0)
        dp[tt][l[tt] - now] = getmin(dp[tt][l[tt] - now], i + 1);
      if (now < 0 && -now - 1 < l[tt]) {
        dp[tt][-now - 1] = getmin(dp[tt][-now - 1], i + 1);
      }
    }
    if (now < 0) {
      for (int i = -now; i < l[tt]; ++i) {
        dp[tt][i] = getmin(dp[tt][i], n + dp[tt][i + now]);
      }
    }
    if (now > 0) {
      for (int i = l[tt] - 1 - now; i >= 0; --i) {
        dp[tt][i] = getmin(dp[tt][i], n + dp[tt][i + now]);
      }
    }
  }
  long long ans = 0;
  int up = 0, down = l[0] - 1;
  int lef = 0, righ = l[1] - 1;
  while (up <= down && lef <= righ) {
    long long x = -1;
    x = getmin(x, dp[0][up]);
    x = getmin(x, dp[0][down]);
    x = getmin(x, dp[1][lef]);
    x = getmin(x, dp[1][righ]);
    if (x == -1) {
      printf("-1\n");
      return 0;
    }
    if (x == dp[0][up]) {
      ans = ans + x % mod * (righ - lef + 1);
      ++up;
    } else if (x == dp[0][down]) {
      ans = ans + x % mod * (righ - lef + 1);
      --down;
    } else if (x == dp[1][lef]) {
      ans = ans + x % mod * (down - up + 1);
      ++lef;
    } else if (x == dp[1][righ]) {
      ans = ans + x % mod * (down - up + 1);
      --righ;
    }
    ans %= mod;
  }
  printf("%d\n", (int)ans);
  return 0;
}
