#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  if (d < 2 && n > 0) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  vector<int> a(n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  int lastjump = -d;
  int curpos = 0;
  vector<bool> r1;
  vector<int> r2;
  for (int i = 0; i < n; i++) {
    if (a[i] - curpos - 1 >= s) {
      r1.push_back(0);
      r2.push_back(a[i] - curpos - 1);
      r1.push_back(1);
      r2.push_back(2);
      curpos = a[i] + 1;
      lastjump = a[i] - 1;
    } else if (a[i] < lastjump + d) {
      r2[r2.size() - 1] = a[i] - lastjump + 1;
      curpos = a[i] + 1;
    } else {
      cout << "IMPOSSIBLE" << endl;
      return 0;
    }
  }
  if (curpos < m) {
    r1.push_back(0);
    r2.push_back(m - curpos);
  }
  for (int i = 0; i < r1.size(); i++) {
    if (r1[i])
      cout << "JUMP ";
    else
      cout << "RUN ";
    cout << r2[i] << endl;
  }
  return 0;
}
