#include <bits/stdc++.h>
using namespace std;
int const M = 1e6 + 5;
int md = 1e9 + 7;
int i, j, n, m, x, y, N, ans, t, k;
int a[M];
int main() {
  ios_base::sync_with_stdio(0);
  int s, d;
  cin >> n >> m >> s >> d;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  if (d == 1 || a[0] <= s) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  vector<pair<int, int> > v;
  int t1 = 0;
  for (i = 1; i < n; i++) {
    if (a[i] - a[i - 1] >= s + 2) {
      v.push_back(make_pair(t1, i - 1));
      t1 = i;
    }
  }
  v.push_back(make_pair(t1, n - 1));
  for (int i = 0; i < (int)v.size(); i++) {
    int i1 = v[i].first;
    int i2 = v[i].second;
    if (a[i2] - a[i1] + 2 > d) {
      cout << "IMPOSSIBLE";
      return 0;
    }
  }
  x = 0;
  for (int i = 0; i < (int)v.size(); i++) {
    int i1 = v[i].first;
    int i2 = v[i].second;
    printf("RUN %d\n", a[i1] - 1 - x);
    printf("JUMP %d\n", a[i2] - a[i1] + 2);
    x = a[i2] + 1;
  }
  if (m - x > 0) printf("RUN %d\n", m - x);
}
