Problem: Fox Ciel safely returned to her castle, but there was something wrong with the security system of the castle: sensors attached in the castle were covering her.

Ciel is at point (1, 1) of the castle now, and wants to move to point (n, n), which is the position of her room. By one step, Ciel can move from point (x, y) to either (x + 1, y) (rightward) or (x, y + 1) (upward).

In her castle, c2 sensors are set at points (a + i, b + j) (for every integer i and j such that: 0 ≤ i < c, 0 ≤ j < c).

Each sensor has a count value and decreases its count value every time Ciel moves. Initially, the count value of each sensor is t. Every time Ciel moves to point (x, y), the count value of a sensor at point (u, v) decreases by (|u - x| + |v - y|). When the count value of some sensor becomes strictly less than 0, the sensor will catch Ciel as a suspicious individual!

Determine whether Ciel can move from (1, 1) to (n, n) without being caught by a sensor, and if it is possible, output her steps. Assume that Ciel can move to every point even if there is a censor on the point.

Input

In the first line there are five integers n, t, a, b, c (2 ≤ n ≤ 2·105,  0 ≤ t ≤ 1014,  1 ≤ a ≤ n - c + 1,  1 ≤ b ≤ n - c + 1,  1 ≤ c ≤ n).

Please do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin stream (also you may use the %I64d specificator).

Output

If Ciel's objective is possible, output in first line 2n - 2 characters that represent her feasible steps, where i-th character is R if i-th step is moving rightward, or U if moving upward. If there are several solution, output lexicographically first one. Character R is lexicographically earlier than the character U.

If her objective is impossible, output Impossible.

Examples

Input

5 25 2 4 1


Output

RRUURURU


Input

3 6 1 2 2


Output

URUR


Input

3 5 1 2 2


Output

Impossible


Input

20 492 11 4 8


Output

RRRRRRRRRRRRRRRRUUUUURUUUUURRUUUUUUUUU

Note

The answers for the first sample and the second sample are shown on the picture: 

<image> Here, a red point represents a point that contains a sensor.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c;
int sx[3], sy[3];
long long t[4];
long long sum(long long a, long long b) {
  if (a > b) swap(a, b);
  return (a + b) * (b - a + 1) / 2;
}
long long calc_cost(int x1, int y1, int x2, int y2, int x, int y) {
  if (y1 == y2)
    return (long long)abs(y - y1) * (abs(x2 - x1) + 1) +
           sum(abs(x - x1), abs(x - x2));
  return (long long)abs(x - x1) * (abs(y2 - y1) + 1) +
         sum(abs(y - y1), abs(y - y2));
}
void go(int& x1, int& y1, int x2, int y2, long long* cost) {
  assert(x1 == x2 || y1 == y2);
  if (x1 == x2)
    y1++;
  else
    x1++;
  for (int i = 0; i < 4; ++i)
    cost[i] += calc_cost(x1, y1, x2, y2, sx[i >> 1], sy[i & 1]);
  x1 = x2;
  y1 = y2;
}
bool bestroute(int x, int y) {
  long long c1[4] = {0}, c2[4] = {0};
  int tx = x, ty = y;
  for (int i = 0; i < 3; ++i) {
    if (tx < sx[i]) go(tx, ty, sx[i], ty, c1);
    if (ty < sy[i]) go(tx, ty, tx, sy[i], c1);
  }
  tx = x;
  ty = y;
  for (int i = 0; i < 3; ++i) {
    if (i != 1) {
      if (tx < sx[i]) go(tx, ty, sx[i], ty, c2);
      if (ty < sy[i]) go(tx, ty, tx, sy[i], c2);
    } else {
      if (ty < sy[i]) go(tx, ty, tx, sy[i], c2);
      if (tx < sx[i]) go(tx, ty, sx[i], ty, c2);
    }
  }
  if (t[0] < c1[0] || t[3] < c1[3] || t[1] < c2[1] || t[2] < c1[2])
    return false;
  assert(c1[1] >= c2[1]);
  assert(c2[2] >= c1[2]);
  long long M1 = max(c1[1], c2[1]), m1 = min(c1[1], c2[1]);
  long long M2 = max(c1[2], c2[2]), m2 = min(c1[2], c2[2]);
  long long ul = min(t[1], M1) - m1, dr = min(t[2], M2) - m2;
  if (ul % 2 == 1) --ul;
  if (dr % 2 == 1) --dr;
  if (ul < 0 || dr < 0 || ul + dr < M1 - m1) return false;
  return true;
}
void enter(int x, int y, int coef) {
  for (int i = 0; i < 4; ++i)
    t[i] += (long long)coef * (abs(sx[i >> 1] - x) + abs(sy[i & 1] - y));
}
void print() {
  for (int i = 0; i < 4; ++i) printf("%lld ", t[i]);
  puts("");
}
int main() {
  scanf("%d%I64d%d%d%d", &n, &t[0], &a, &b, &c);
  t[1] = t[2] = t[3] = t[0];
  sx[0] = a;
  sx[1] = a + c - 1;
  sx[2] = n;
  sy[0] = b;
  sy[1] = b + c - 1;
  sy[2] = n;
  int cx = 1, cy = 1;
  if (!bestroute(cx, cy)) {
    puts("Impossible");
    return 0;
  }
  for (int i = 0; i < 2 * n - 2; ++i) {
    if (cx < n) {
      cx++;
      enter(cx, cy, -1);
      if (bestroute(cx, cy)) {
        putchar('R');
        continue;
      }
      enter(cx, cy, 1);
      cx--;
    }
    cy++;
    enter(cx, cy, -1);
    putchar('U');
    assert(bestroute(cx, cy));
  }
  puts("");
  return 0;
}