#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:667772160")
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
pair<long long, long long> arr[200000 + 7];
long long inp[200000 + 7];
int main() {
  long long n, m, s, d, df;
  scanf("%lld %lld", &n, &m);
  scanf("%lld %lld", &s, &d);
  for (int i = 0; i < n; i++) scanf("%lld", &inp[i]);
  sort(inp, inp + n);
  long long pre = 0;
  int id = 0;
  arr[id].first = inp[0] - 1;
  arr[id].second = inp[0];
  for (int i = 1; i < n; i++) {
    df = inp[i] - inp[i - 1] - 2;
    if (df < s)
      arr[id].second = inp[i];
    else {
      id++;
      arr[id].first = inp[i] - 1;
      arr[id].second = inp[i];
    }
  }
  if (arr[0].first < s) {
    printf("IMPOSSIBLE\n");
    return 0;
  }
  for (int i = 0; i <= id; i++) {
    arr[i].second = arr[i].second - arr[i].first + 1;
    if (arr[i].second > d) {
      printf("IMPOSSIBLE\n");
      return 0;
    }
  }
  printf("RUN %lld\n", arr[0].first);
  pre = arr[0].first;
  for (int i = 0; i <= id; i++) {
    if (i > 0) printf("RUN %lld\n", arr[i].first - pre);
    printf("JUMP %lld\n", arr[i].second);
    pre += (arr[i].first - pre);
    pre += arr[i].second;
  }
  if (pre < m) printf("RUN %lld\n", m - pre);
  return 0;
}
