#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, s, d;
  scanf("%d%d%d%d", &n, &m, &s, &d);
  int a[n + 1];
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int cur = 0;
  vector<pair<int, int> > moves;
  for (int i = 1; i <= n; ++i) {
    if (a[i] < cur) continue;
    if ((a[i] - cur - 1) >= s) {
      moves.push_back({0, a[i] - cur - 1});
      cur = a[i] - 1;
      int old = cur, k = i;
      ++cur;
      while (k <= n && (a[k] == cur || (a[k] - cur - 1) < s)) {
        cur = a[k] + 1;
        ++k;
      }
      if (old == cur) continue;
      if ((cur - old) > d) {
        puts("IMPOSSIBLE");
        return 0;
      } else
        moves.push_back({1, cur - old});
    } else {
      puts("IMPOSSIBLE");
      return 0;
    }
  }
  if (m != cur) moves.push_back({0, m - cur});
  for (pair<int, int> p : moves) {
    if (!p.first)
      printf("RUN %d\n", p.second);
    else
      printf("JUMP %d\n", p.second);
  }
  return 0;
}
