#include <bits/stdc++.h>
using namespace std;
long long a[200100];
vector<string> res;
long long n, finish, s, jump, k, now = 0;
void goToFinish() {
  if (now != finish) {
    res.push_back("RUN " + to_string((long long)(finish - now)));
  }
}
bool distToJump() {
  if (a[k] - now - 1 >= s) {
    return 1;
  }
  return 0;
}
void goToNextLet() {
  if (now != a[k] - 1) {
    res.push_back("RUN " + to_string((long long)(a[k] - 1 - now)));
    now = a[k] - 1;
  }
}
int findLet() {
  int result = -1;
  for (int i = k + 1; i < n; i++) {
    if ((a[i] - a[i - 1] - 2 >= s) && (a[i - 1] + 1 - now <= jump)) {
      return i - 1;
    }
  }
  if (a[n - 1] + 1 - now <= jump) return n - 1;
  return -1;
}
bool jumpOverLet() {
  int let = findLet();
  if (let == -1) {
    return 0;
  } else {
    res.push_back("JUMP " + to_string((long long)(a[let] + 1 - now)));
    now = a[let] + 1;
    k = let + 1;
    return 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> finish >> s >> jump;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  while (true) {
    if (k == n) {
      goToFinish();
      break;
    } else {
      if (distToJump()) {
        goToNextLet();
        if (jumpOverLet())
          ;
        else {
          cout << "IMPOSSIBLE";
          return 0;
        }
      } else {
        cout << "IMPOSSIBLE";
        return 0;
      }
    }
  }
  for (int i = 0; i < res.size(); i++) {
    cout << res[i] << "\n";
  }
  return 0;
}
