#include <bits/stdc++.h>
using namespace std;
long long n, m, S, d, x[300001];
vector<pair<char, long long> > ans;
bool run(long long pos, long long l) {
  if (x[l + 1] >= pos && x[l + 1] <= pos + S) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> S >> d;
  for (int i = 0; i < n; i++) cin >> x[i];
  sort(x, x + n);
  long long start = 0;
  for (int i = 0; i < n; i++) {
    ans.push_back(make_pair('r', x[i] - 1 - start));
    if (x[i] - 1 - start < S) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    start = x[i] - 1;
    for (int j = i; j < n; j++) {
      if (run(x[j] + 1, j)) {
        if (x[j] + 1 - start > d) {
          cout << "IMPOSSIBLE";
          return 0;
        }
        ans.push_back(make_pair('j', x[j] + 1 - start));
        start = x[j] + 1;
        i = j;
        break;
      } else {
        if (j == n - 1) {
          cout << "IMPOSSIBLE";
          return 0;
        }
      }
    }
  }
  if (ans.empty()) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i].first == 'r')
      cout << "RUN ";
    else
      cout << "JUMP ";
    cout << ans[i].second << endl;
  }
  if (start != m) cout << "RUN " << m - start;
}
