#include <bits/stdc++.h>
using namespace std;
struct ww {
  int x, y;
} a[4], O;
int i, j, k, n, m, len, nx, ny, x, y;
long long T, b[4], c[4];
inline int dis(ww A, ww B) { return abs(A.x - B.x) + abs(A.y - B.y); }
inline void Do(ww &A, ww B) {
  int i;
  if (A.x < B.x) {
    for (i = 0; i <= 3; i++) {
      long long l = dis((ww){A.x + 1, A.y}, a[i]);
      long long r = dis((ww){B.x, A.y}, a[i]);
      long long s = (l + r) * (abs(l - r) + 1) / 2;
      c[i] -= s;
    }
    A.x = B.x;
  }
  if (A.y < B.y) {
    for (i = 0; i <= 3; i++) {
      long long l = dis((ww){A.x, A.y + 1}, a[i]);
      long long r = dis((ww){A.x, B.y}, a[i]);
      long long s = (l + r) * (abs(l - r) + 1) / 2;
      c[i] -= s;
    }
    A.y = B.y;
  }
}
inline bool ju(long long a1, long long a2) {
  if (a1 < 0 || a2 < 0) return 0;
  long long s1 = dis(a[1], O), s2 = dis(a[2], O), Dis = dis(O, a[3]),
            X = a[3].y - O.y;
  s1 *= Dis, s2 *= Dis;
  long long sum = Dis * (1 + Dis) / 2;
  s1 -= sum, s2 -= sum;
  if (s1 > a1 || s2 > a2) return 0;
  sum *= 2;
  long long mi = X * (X + 1), ma = X * (Dis + (Dis - X + 1));
  long long A = (a1 - s1) / 2 * 2;
  if (A < mi) return 0;
  A = min(A, ma);
  return s2 + sum - A <= a2;
}
inline bool pan(int x, int y) {
  int i;
  O = (ww){x, y};
  for (i = 0; i <= 3; i++) c[i] = b[i] - dis(a[i], O);
  Do(O, a[0]);
  if (O.x <= a[3].x && O.y <= a[3].y) {
    ww A = a[3];
    Do(A, (ww){n, n});
    long long a1 = c[1], a2 = c[2];
    A = O;
    Do(A, a[3]);
    if (c[0] < 0 || c[3] < 0) return 0;
    return ju(a1, a2);
  }
  if (O.x < a[3].x) Do(O, (ww){a[3].x, O.y});
  if (O.y < a[3].y) Do(O, (ww){O.x, a[3].y});
  Do(O, (ww){n, n});
  for (i = 0; i <= 3; i++)
    if (c[i] < 0) return 0;
  return 1;
}
int main() {
  scanf("%d%I64d%d%d%d", &n, &T, &x, &y, &len);
  len--;
  a[0] = (ww){x, y}, a[1] = (ww){x + len, y}, a[2] = (ww){x, y + len},
  a[3] = (ww){x + len, y + len};
  for (i = 0; i <= 3; i++) b[i] = T;
  nx = ny = 1;
  if (!pan(1, 2) && !pan(2, 1)) {
    printf("Impossible\n");
    return 0;
  }
  for (i = 1; i <= 2 * n - 2; i++) {
    if (nx < n && pan(nx + 1, ny))
      nx++, printf("R");
    else
      ny++, printf("U");
    for (j = 0; j <= 3; j++) b[j] -= dis(a[j], (ww){nx, ny});
  }
  printf("\n");
  return 0;
}
