Problem: Limak is a little polar bear. His parents told him to clean a house before the New Year's Eve. Their house is a rectangular grid with h rows and w columns. Each cell is an empty square.

He is a little bear and thus he can't clean a house by himself. Instead, he is going to use a cleaning robot.

A cleaning robot has a built-in pattern of n moves, defined by a string of the length n. A single move (character) moves a robot to one of four adjacent cells. Each character is one of the following four: 'U' (up), 'D' (down), 'L' (left), 'R' (right). One move takes one minute.

A cleaning robot must be placed and started in some cell. Then it repeats its pattern of moves till it hits a wall (one of four borders of a house). After hitting a wall it can be placed and used again.

Limak isn't sure if placing a cleaning robot in one cell will be enough. Thus, he is going to start it w·h times, one time in each cell. Maybe some cells will be cleaned more than once but who cares?

Limak asks you one question. How much time will it take to clean a house? Find and print the number of minutes modulo 109 + 7. It's also possible that a cleaning robot will never stop — then print "-1" (without the quotes) instead.

Placing and starting a robot takes no time, however, you must count a move when robot hits a wall. Take a look into samples for further clarification.

Input

The first line contains three integers n, h and w (1 ≤ n, h, w ≤ 500 000) — the length of the pattern, the number of rows and the number of columns, respectively.

The second line contains a string of length n — the pattern of n moves. Each character is one of uppercase letters 'U', 'D', 'L' or 'R'.

Output

Print one line with the answer.

If a cleaning robot will never stop, print "-1" (without the quotes). Otherwise, print the number of minutes it will take to clean a house modulo 109 + 7.

Examples

Input

1 10 2
R


Output

30


Input

3 4 6
RUL


Output

134


Input

4 1 500000
RLRL


Output

-1

Note

In the first sample house is a grid with 10 rows and 2 columns. Starting a robot anywhere in the second column will result in only one move (thus, one minute of cleaning) in which robot will hit a wall — he tried to go right but there is no third column. Starting a robot anywhere in the first column will result in two moves. The total number of minutes is 10·1 + 10·2 = 30.

In the second sample a started robot will try to move "RULRULRULR..." For example, for the leftmost cell in the second row robot will make 5 moves before it stops because of hitting an upper wall.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 5E5 + 5;
const int MOD = 1E9 + 7;
const long long inf = 1E18;
struct map {
  int x;
  long long t;
} a[4];
long long x, y, n, h, w, p, to, U[N], D[N], L[N], R[N];
long long ans, u, d, l, r, t;
char s[N];
int main() {
  cin >> n >> h >> w;
  u = l = 1;
  r = w;
  d = h;
  scanf("\n%s", s + 1);
  for (int i = 1; i <= n; i++) {
    if (s[i] == 'U') {
      x--;
      if (x < 0 && !U[-x]) U[-x] = i;
    } else if (s[i] == 'D') {
      x++;
      if (x > 0 && !D[x]) D[x] = i;
    } else if (s[i] == 'L') {
      y--;
      if (y < 0 && !L[-y]) L[-y] = i;
    } else {
      y++;
      if (y > 0 && !R[y]) R[y] = i;
    }
  }
  a[0].x = a[1].x = a[2].x = a[3].x = 1;
  a[0].t = U[1];
  a[1].t = D[1];
  a[2].t = L[1];
  a[3].t = R[1];
  for (;;) {
    p = 0;
    for (int j = 1; j < 4; j++)
      if (a[j].t && (!a[p].t || a[j].t < a[p].t)) p = j;
    if (!a[p].t) {
      cout << -1;
      return 0;
    }
    t = a[p].t;
    if (p == 0) {
      ans = (ans + a[p].t % MOD * (r - l + 1)) % MOD;
      u++;
      a[p].t = t + U[a[p].x + 1] - U[a[p].x];
      if (!U[a[p].x + 1]) {
        to = a[p].x + x + 1;
        if (to < N && U[to]) a[p].t = t + n - U[a[p].x] + U[to];
        a[p].x = to;
      } else
        a[p].x++;
    } else if (p == 1) {
      ans = (ans + a[p].t % MOD * (r - l + 1)) % MOD;
      d--;
      a[p].t = t + D[a[p].x + 1] - D[a[p].x];
      if (!D[a[p].x + 1]) {
        to = a[p].x - x + 1;
        if (to < N && D[to]) a[p].t = t + n - D[a[p].x] + D[to];
        a[p].x = to;
      } else
        a[p].x++;
    } else if (p == 2) {
      ans = (ans + a[p].t % MOD * (d - u + 1)) % MOD;
      l++;
      a[p].t = t + L[a[p].x + 1] - L[a[p].x];
      if (!L[a[p].x + 1]) {
        to = a[p].x + y + 1;
        if (to < N && L[to]) a[p].t = t + n - L[a[p].x] + L[to];
        a[p].x = to;
      } else
        a[p].x++;
    } else {
      ans = (ans + a[p].t % MOD * (d - u + 1)) % MOD;
      r--;
      a[p].t = t + R[a[p].x + 1] - R[a[p].x];
      if (!R[a[p].x + 1]) {
        to = a[p].x - y + 1;
        if (to < N && R[to]) a[p].t = t + n - R[a[p].x] + R[to];
        a[p].x = to;
      } else
        a[p].x++;
    }
    if (u > d || l > r) {
      cout << ans;
      return 0;
    }
  }
}