#include <bits/stdc++.h>
using namespace std;
int n, m, r, d;
int a[200001];
vector<int> jumps, landoffs;
int main() {
  scanf("%d %d %d %d", &n, &m, &r, &d);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n);
  a[n] = a[n - 1] + r + 3;
  int len = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] - a[i - 1] >= r + 2) {
      if (len + 2 > d) {
        printf("IMPOSSIBLE\n");
        return 0;
        ;
      }
      landoffs.push_back(a[i - 1] - len - 1);
      jumps.push_back(len + 2);
      len = 0;
    } else {
      len += a[i] - a[i - 1];
    }
  }
  if (a[0] <= r) {
    printf("IMPOSSIBLE\n");
    return 0;
    ;
  }
  int x = 0;
  for (int i = 0; i < jumps.size(); i++) {
    printf("RUN %d\n", landoffs[i] - x);
    printf("JUMP %d\n", jumps[i]);
    x = landoffs[i] + jumps[i];
  }
  if (x < m) printf("RUN %d\n", m - x);
  return 0;
}
