#include <bits/stdc++.h>
using namespace std;
int N, M, s, d;
int main() {
  cin >> N >> M >> s >> d;
  vector<int> a;
  a.reserve(N + 2);
  a.push_back(-1);
  for (int i = 0; i < N; ++i) {
    int W;
    cin >> W;
    a.push_back(W);
  }
  sort(a.begin(), a.end());
  a.push_back(M + 1);
  stringstream sout;
  int up = -d, down = 0;
  bool impossible = false;
  for (int i = 1; (i <= N + 1) && !impossible; ++i) {
    if (a[i] - a[i - 1] > s + 1 || i == N + 1) {
      down = a[i - 1] + 1;
      if (down - up <= d) {
        if (down != 0) {
          sout << "JUMP " << down - up << endl;
        }
        if (a[i] - a[i - 1] - 2 > 0) {
          sout << "RUN " << a[i] - a[i - 1] - 2 << endl;
        }
        up = a[i] - 1;
      } else {
        impossible = true;
      }
    }
  }
  if (impossible) {
    cout << "IMPOSSIBLE";
  } else {
    cout << sout.str();
  }
  return 0;
}
