#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  int *arr = new int[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  if (arr[0] - 1 < s) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  if (d == 1) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  int i = 0;
  bool was_impossible = false;
  vector<pair<string, int>> g;
  int k = 0;
  int last;
  while (i < n) {
    if (i == 0) {
      g.push_back(make_pair("RUN ", arr[i] - 1));
    } else {
      g.push_back(make_pair("RUN ", arr[i] - arr[i - 1] - 2));
    }
    if (arr[i + 1] - arr[i] - 2 >= s || i == n - 1) {
      g.push_back(make_pair("JUMP ", 2));
      last = arr[i] + 1;
      i++;
      continue;
    }
    for (int j = i + 1; j <= n - 1; j++) {
      if (arr[j] - arr[i] + 2 <= d &&
          (j == n - 1 || arr[j + 1] - arr[j] - 2 >= s)) {
        g.push_back(make_pair("JUMP ", arr[j] - arr[i] + 2));
        last = arr[j] + 1;
        i = j + 1;
        break;
      }
      if (j == n - 1) {
        cout << "IMPOSSIBLE";
        was_impossible = true;
        return 0;
      }
    }
  }
  if (m - last != 0) {
    g.push_back(make_pair("RUN ", m - last));
  }
  if (was_impossible) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  for (vector<pair<string, int>>::iterator it = g.begin(); it != g.end();
       ++it) {
    cout << it->first << it->second << endl;
  }
  return 0;
}
