#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005;
const int mod = 1000000007;
int bit[4][maxn];
int low(int p) { return p & (-p); }
void merg(int u, int p, int n, int k) {
  while (p <= n) {
    bit[u][p] = max(bit[u][p], k);
    p = p + low(p);
  }
}
int sum(int u, int p) {
  int s = 0;
  while (p) {
    s = max(s, bit[u][p]);
    p = p - low(p);
  }
  return s;
}
long long a[maxn], b[maxn];
int m[4][maxn];
char c[maxn];
int main() {
  int i, n, w, h;
  cin >> n >> h >> w;
  scanf("%s", c);
  int x = 0, y = 0;
  for (i = 0; i < n; i++) {
    if (c[i] == 'R') {
      y++;
      if (y > 0) merg(3, i + 1, n, y);
    } else if (c[i] == 'L') {
      y--;
      if (y < 0) {
        merg(2, i + 1, n, -y);
      }
    } else if (c[i] == 'U') {
      x--;
      if (x < 0) {
        merg(0, i + 1, n, -x);
      }
    } else {
      x++;
      if (x > 0) {
        merg(1, i + 1, n, x);
      }
    }
  }
  if (x == 0 && y == 0) {
    if (sum(0, n) + sum(1, n) + 1 <= h && sum(3, n) + sum(2, n) + 1 <= w) {
      printf("-1\n");
      return 0;
    }
  }
  int x1 = 0, y1 = 0;
  for (i = 1; i < maxn; i++) {
    m[0][i] = max(m[0][i - 1], -x1 + sum(0, n));
    m[1][i] = max(m[1][i - 1], x1 + sum(1, n));
    m[2][i] = max(m[2][i - 1], -y1 + sum(2, n));
    m[3][i] = max(m[3][i - 1], y1 + sum(3, n));
    x1 += x;
    y1 += y;
  }
  for (i = 1; i <= h; i++) {
    long long le = 1, ri = (long long)1 << 40, mid;
    while (le <= ri) {
      mid = (le + ri) / 2;
      long long p = (mid - 1) / n;
      if (p >= maxn) {
        p = maxn - 1;
        if (m[0][p] >= i || m[1][p] >= h - i + 1) {
          ri = mid - 1;
          continue;
        }
        le = mid + 1;
        continue;
      }
      if (m[0][p] >= i || m[1][p] >= h - i + 1) {
        ri = mid - 1;
        continue;
      }
      long long x1 = i + p * x;
      if (x1 <= sum(0, mid - p * n)) {
        ri = mid - 1;
        continue;
      }
      if (sum(1, mid - p * n) >= h - x1 + 1) {
        ri = mid - 1;
        continue;
      }
      le = mid + 1;
    }
    a[i] = le;
  }
  for (i = 1; i <= w; i++) {
    long long le = 1, ri = (long long)1 << 40, mid;
    while (le <= ri) {
      mid = (le + ri) / 2;
      long long p = (mid - 1) / n;
      if (p >= maxn) {
        p = maxn - 1;
        if (m[2][p] >= i || m[3][p] >= w - i + 1) {
          ri = mid - 1;
          continue;
        }
        le = mid + 1;
        continue;
      }
      if (m[2][p] >= i || m[3][p] >= w - i + 1) {
        ri = mid - 1;
        continue;
      }
      long long x1 = i + p * y;
      if (x1 <= sum(2, (int)(mid - p * n))) {
        ri = mid - 1;
        continue;
      }
      if (sum(3, (int)(mid - p * n)) >= w - x1 + 1) {
        ri = mid - 1;
        continue;
      }
      le = mid + 1;
    }
    b[i] = le;
  }
  sort(a + 1, a + 1 + h);
  sort(b + 1, b + 1 + w);
  x = 1;
  y = 1;
  long long s = 0;
  while (x <= h && y <= w) {
    if (a[x] == b[y]) {
      s += ((long long)(w - y + 1) + (h - x + 1) - 1) * a[x];
      x++;
      y++;
    } else {
      if (a[x] < b[y]) {
        s += (long long)a[x] * (w - y + 1);
        x++;
      } else {
        s += (long long)b[y] * (h - x + 1);
        y++;
      }
    }
    s %= mod;
  }
  cout << s << endl;
}
