#include <bits/stdc++.h>
using namespace std;
const int MXN = 200100;
int x[MXN];
int main() {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  for (int i = (0); i < (n); i++) {
    cin >> x[i];
  }
  sort(x, x + n);
  if (x[0] < s + 1) {
    printf("IMPOSSIBLE\n");
    return 0;
  }
  int cur = 0, cpos = 0;
  for (; cur < n;) {
    int j = cur + 1;
    for (; j < n && x[j] - x[j - 1] < s + 2; j++)
      ;
    j--;
    if (x[j] + 1 - (x[cur] - 1) > d) {
      printf("IMPOSSIBLE\n");
      return 0;
    }
    cur = j + 1;
    cpos = x[j] + 1;
  }
  cpos = 0, cur = 0;
  for (; cur < n;) {
    int j = cur + 1;
    for (; j < n && x[j] - x[j - 1] < s + 2; j++)
      ;
    j--;
    printf("RUN %d\n", x[cur] - 1 - cpos);
    printf("JUMP %d\n", x[j] + 1 - (x[cur] - 1));
    cur = j + 1;
    cpos = x[j] + 1;
  }
  if (cpos < m) {
    printf("RUN %d\n", m - cpos);
  }
}
