#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
  }
  arr.push_back(m + 1);
  sort(arr.begin(), arr.end());
  vector<pair<bool, int> > answer;
  int cur = arr[0] - 1;
  if (cur >= s) {
    answer.push_back(make_pair(false, cur));
  } else {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  int idx = 0;
  while (cur < m) {
    bool found = false;
    for (int i = idx; i < n; i++) {
      if (arr[i] + 1 - cur <= d &&
          (i == n - 1 || arr[i + 1] - arr[i] - 2 >= s)) {
        found = true;
        answer.push_back(make_pair(true, arr[i] + 1 - cur));
        cur = arr[i] + 1;
        answer.push_back(make_pair(false, arr[i + 1] - 1 - cur));
        cur = arr[i + 1] - 1;
        idx = i + 1;
        break;
      }
    }
    if (!found) {
      cout << "IMPOSSIBLE" << endl;
      return 0;
    }
  }
  if (answer.back().second == 0) {
    answer.pop_back();
  }
  for (int i = 0; i < answer.size(); i++) {
    if (!answer[i].first) {
      printf("RUN ");
    } else {
      printf("JUMP ");
    }
    printf("%d\n", answer[i].second);
  }
  return 0;
}
