#include <bits/stdc++.h>
using namespace std;
int absolut(int x) {
  if (x < 0) return -x;
  return x;
}
long long int cuad(long long int x) { return x * (x + 1) / 2; }
int n;
long long int t;
int a, b, c;
string sol;
bool puede(int x, int y, int xs, int ys, long long int ts) {
  long long int d1 = absolut(x - xs) + absolut(y - ys);
  long long int d2 = absolut(n - xs) + absolut(n - ys);
  if (x <= xs and y <= ys) {
    return cuad(d1) + cuad(d2) <= ts;
  } else if (x <= xs) {
    return cuad(d2) - cuad(y - ys - 1) + cuad(d1) - cuad(y - ys) <= ts;
  } else if (y <= ys) {
    return cuad(d2) - cuad(x - xs - 1) + cuad(d1) - cuad(x - xs) <= ts;
  }
  return cuad(d2) - cuad(d1 - 1) <= ts;
}
int xs[4], ys[4];
long long int ts[4];
bool puede(int x, int y) {
  for (int i = 0; i < 4; i++)
    if (not puede(x, y, xs[i], ys[i], ts[i])) return false;
  return true;
}
int main() {
  cin >> n >> t >> a >> b >> c;
  for (int i = 0; i < 4; i++) {
    xs[i] = a + (i / 2) * (c - 1);
    ys[i] = b + (i % 2) * (c - 1);
    ts[i] = t;
  }
  int x = 1, y = 1;
  while (not(x == n and y == n)) {
    if (x < n and puede(x + 1, y)) {
      x++;
      sol += "R";
    } else if (y < n and puede(x, y + 1)) {
      y++;
      sol += "U";
    } else {
      cout << "Impossible" << endl;
      exit(0);
    }
    for (int i = 0; i < 4; i++)
      ts[i] -= absolut(x - xs[i]) + absolut(y - ys[i]);
  }
  cout << sol << endl;
}
