#include <bits/stdc++.h>
using namespace std;
int n, m, s, d;
int a[200002];
vector<pair<int, int>> b;
int main() {
  scanf("%d%d%d%d", &n, &m, &s, &d);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  int l, r;
  for (int i = 0; i < n; i++) {
    l = a[i] - 1;
    r = a[i] + 1;
    while (i < n - 1 && a[i + 1] - a[i] < s + 2) i++;
    r = a[i] + 1;
    if (r - l > d || l < s) {
      printf("IMPOSSIBLE");
      return 0;
    }
    b.push_back(std::make_pair(l, r));
  }
  int x = 0, y = 0;
  for (int j = 0; j < b.size(); j++) {
    x = b[j].first;
    printf("RUN %d\n", x - y);
    y = b[j].second;
    printf("JUMP %d\n", y - x);
  }
  if (m > y) printf("RUN %d\n", m - y);
  return 0;
}
