#include <bits/stdc++.h>
using namespace std;
const int MAX = 200010;
int a[MAX];
int main() {
  int n, m, s, d;
  scanf("%d %d %d %d", &n, &m, &s, &d);
  for (int i = (0); i < (n); ++i) scanf("%d", &a[i]);
  sort(a, a + n);
  vector<pair<int, int> > segs;
  for (int i = (1); i < (n); ++i) {
    if (a[i] - a[i - 1] >= s + 2) {
      segs.push_back(make_pair(a[i - 1] + 1, a[i] - 1));
    }
  }
  vector<pair<int, int> > ops;
  int cur_pos = 0;
  if (a[0] > 0) {
    ops.push_back(make_pair(0, a[0] - 1));
    cur_pos += a[0] - 1;
  }
  int ok = 1;
  if (a[0] <= s) {
    ok = 0;
  }
  for (int i = (0); i < ((int)((segs).size())); ++i) {
    int dist = segs[i].first - cur_pos;
    if (dist > d) ok = 0;
    ops.push_back(make_pair(1, dist));
    ops.push_back(make_pair(0, segs[i].second - segs[i].first));
    cur_pos = segs[i].second;
  }
  if (a[n - 1] + 1 - cur_pos > d) ok = 0;
  ops.push_back(make_pair(1, a[n - 1] + 1 - cur_pos));
  cur_pos = a[n - 1] + 1;
  if (a[n - 1] != m - 1) {
    ops.push_back(make_pair(0, m - a[n - 1] - 1));
  }
  if (!ok) {
    puts("IMPOSSIBLE");
  } else {
    for (const pair<int, int>& p : ops) {
      if (p.first == 0) printf("RUN %d\n", p.second);
      if (p.first == 1) printf("JUMP %d\n", p.second);
    }
  }
  return 0;
}
