#include <bits/stdc++.h>
using namespace std;
long long n, f, r, d;
vector<long long> x;
vector<long long> dei;
long long qsa(long long j) {
  while (j < n - 1 && x[j + 1] - x[j] <= r + 1) j++;
  return j;
}
int main() {
  cin >> n >> f >> r >> d;
  x.resize(n);
  for (int i = 0; i < n; i++) scanf("%d", &x[i]);
  sort(x.begin(), x.end());
  if (x[0] <= r) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  long long i = 0, cur = 0;
  while (true) {
    long long kol = qsa(i);
    long long shirina = x[kol] - x[i] + 1;
    if (shirina >= d) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    dei.push_back(x[i] - 1 - cur);
    cur = x[i] - 1;
    dei.push_back(shirina + 1);
    cur += shirina + 1;
    i = kol + 1;
    if (i == n) {
      for (int q = 0; q < dei.size(); q += 2) {
        cout << "RUN " << dei[q] << endl;
        cout << "JUMP " << dei[q + 1] << endl;
      }
      if (f - cur) cout << "RUN " << f - cur << endl;
      return 0;
    }
  }
  return 0;
}
