#include <bits/stdc++.h>
using namespace std;
vector<pair<bool, int> > x;
int main() {
  int n, m, s, d, nos[200005], a = 0, pos = 0;
  scanf("%d%d%d%d", &n, &m, &s, &d);
  for (int i = 0; i < n; ++i) scanf("%d", &nos[i]);
  sort(nos, nos + n);
  x.push_back(make_pair(0, nos[0] - 1)), pos = nos[0] - 1;
  for (int i = 1; i < n; ++i)
    if (nos[i] - nos[i - 1] >= s + 2)
      x.push_back(make_pair(1, nos[i - 1] + 1 - pos)),
          x.push_back(make_pair(0, nos[i] - nos[i - 1] - 2)), pos = nos[i] - 1;
  x.push_back(make_pair(1, nos[n - 1] + 1 - pos)), pos = nos[n - 1] + 1;
  for (int i = 0; i < x.size(); ++i)
    if ((x[i].first == 0 && x[i].second < s) ||
        (x[i].first == 1 && x[i].second > d))
      a = 1;
  if (m - pos) x.push_back(make_pair(0, m - pos));
  if (a)
    printf("IMPOSSIBLE\n");
  else {
    for (int i = 0; i < x.size(); ++i) {
      if (x[i].first == 0)
        printf("RUN %d\n", x[i].second);
      else
        printf("JUMP %d\n", x[i].second);
    }
  }
}
