#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, s, d;
  scanf("%lld%lld%lld%lld", &n, &m, &s, &d);
  vector<int> mas(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &mas[i]);
  }
  sort(mas.begin(), mas.end());
  vector<pair<int, bool> > tr;
  tr.reserve(2 * n + 10);
  if (s > mas[0] - 1) {
    printf("IMPOSSIBLE\n");
    return 0;
  }
  tr.push_back(make_pair(mas[0] - 1, false));
  for (int i = 1; i < n; i++) {
    if (mas[i] - mas[i - 1] - 2 >= s) {
      tr.push_back(make_pair(mas[i - 1] + 1, true));
      tr.push_back(make_pair(mas[i] - 1, false));
    }
  }
  tr.push_back(make_pair(mas[n - 1] + 1, true));
  if (mas[n - 1] + 1 < m) tr.push_back(make_pair(m, false));
  for (int i = 1; i < tr.size(); i += 2) {
    if (tr[i].first - tr[i - 1].first > d) {
      printf("IMPOSSIBLE\n");
      return 0;
    }
  }
  int pos = 0;
  for (int i = 0; i < tr.size(); i++) {
    if (tr[i].second) {
      printf("JUMP %d\n", tr[i].first - pos);
    } else {
      printf("RUN %d\n", tr[i].first - pos);
    }
    pos = tr[i].first;
  }
  return 0;
}
