#include <bits/stdc++.h>
using namespace std;
vector<long long> Ans;
vector<long long> Mas;
int main() {
  long long n, fil, s, d, pos1, pos2, el;
  int i, j;
  scanf("%I64d%I64d%I64d%I64d", &n, &fil, &s, &d);
  for (i = 0; i < n; i++) {
    scanf("%I64d", &el);
    Mas.push_back(el);
  }
  sort(Mas.begin(), Mas.end());
  i = 0;
  long long pos = 0;
  while (i < n) {
    j = i;
    while (i + 1 < n && Mas[i + 1] - Mas[i] - 2 < s) {
      i++;
    }
    pos1 = Mas[j] - 1;
    pos2 = Mas[i] + 1;
    if (pos1 == 0 || pos2 == 0) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    if (pos1 - pos < s) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    if (pos2 - pos1 > d) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    Ans.push_back(pos1 - pos);
    Ans.push_back(pos2 - pos1);
    i++;
    pos = pos2;
  }
  if (fil != pos) {
    Ans.push_back(fil - pos);
  }
  for (int i = 0; i < Ans.size(); i++) {
    if (i % 2 == 0) {
      printf("RUN %I64d\n", Ans[i]);
    } else {
      printf("JUMP %I64d\n", Ans[i]);
    }
  }
  return 0;
}
