#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
long long n, t, a, b, c;
struct node {
  long long val;
  long long x, y;
} p[4], tmp[4];
void calculate(node &A) {
  long long len = A.x + A.y - 2;
  A.val = len * (len - 1) / 2;
  len = 2 * n - A.x - A.y;
  A.val += len * (len + 1) / 2;
}
bool mp1(long long x, long long y) {
  if (x + 1 > n) return false;
  for (int i = 0; i < (c > 1 ? 4 : 1); i++) {
    tmp[i] = p[i];
    if (p[i].x < x && p[i].y < y) continue;
    if (p[i].x > x && p[i].y > y) continue;
    if (y < p[i].y) {
      tmp[i].val += abs(p[i].y - y) * 2;
      if (tmp[i].val > t) return false;
    }
  }
  ++x;
  long long left = 0;
  if (c > 1 && x < p[3].x && y < p[3].y) {
    long long lx = p[3].x - x + 1, ly = p[3].y - y + 1;
    lx = min(lx, c);
    ly = min(ly, c);
    left = lx * ly - lx - ly + 1;
  }
  if (c > 1 && (t - tmp[1].val >> 1) + (t - tmp[2].val >> 1) < left)
    return false;
  for (int i = 0; i < (c > 1 ? 4 : 1); i++) p[i].val = tmp[i].val;
  return true;
}
bool mp2(long long x, long long y) {
  if (y + 1 > n) return false;
  for (int i = 0; i < (c > 1 ? 4 : 1); i++) {
    tmp[i] = p[i];
    if (p[i].x < x && p[i].y < y) continue;
    if (p[i].x > x && p[i].y > y) continue;
    if (x < p[i].x) {
      tmp[i].val += abs(p[i].x - x) * 2;
      if (tmp[i].val > t) return false;
    }
  }
  ++y;
  long long left = 0;
  if (c > 1 && x < p[3].x && y < p[3].y) {
    long long lx = p[3].x - x + 1, ly = p[3].y - y + 1;
    lx = min(lx, c);
    ly = min(ly, c);
    left = lx * ly - lx - ly + 1;
  }
  if (c > 1 && (t - tmp[1].val >> 1) + (t - tmp[2].val >> 1) < left)
    return false;
  for (int i = 0; i < (c > 1 ? 4 : 1); i++) p[i].val = tmp[i].val;
  return true;
}
int main() {
  cin >> n >> t >> a >> b >> c;
  for (int i = 0; i < 4; i++) {
    p[i].x = a + (i & 1 ? c - 1 : 0);
    p[i].y = b + (i & 2 ? c - 1 : 0);
    calculate(p[i]);
    if (p[i].val > t) {
      puts("Impossible");
      return 0;
    }
  }
  if (c > 1 && (t - p[1].val >> 1) + (t - p[2].val >> 1) < c * c - c * 2 + 1) {
    puts("Impossible");
    return 0;
  }
  long long nowx = 1, nowy = 1;
  while (nowx != n || nowy != n) {
    if (mp1(nowx, nowy)) {
      ++nowx;
      putchar('R');
    } else if (mp2(nowx, nowy)) {
      ++nowy;
      putchar('U');
    }
  }
  return 0;
}
