#include <bits/stdc++.h>
using namespace std;
long long int logy(long long int x, long long int y) {
  return ceil((long double)(log(x) / log(y)));
}
long long int powe(long long int a, long long int b) {
  long long int re = 1;
  while (b) {
    if (b & 1) re = (re * a);
    a = (a * a);
    b = b >> 1;
  }
  return re;
}
bool flag = 0, flag1 = 0, flag2 = 0;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int tt = 1;
  while (tt--) {
    long long int n, m, r, j;
    cin >> n >> m >> r >> j;
    long long int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    ;
    sort(a, a + n);
    vector<pair<long long, long long> > v;
    v.push_back({a[0], a[0]});
    for (long long int i = 1; i < n; i++) {
      long long int last = v[v.size() - 1].second;
      if (a[i] - last - 2 >= r)
        v.push_back({a[i], a[i]});
      else
        v[v.size() - 1].second = a[i];
    }
    if (a[0] - 1 < r) flag = 1;
    for (long long int i = 0; i < v.size(); i++)
      if (v[i].second - v[i].first + 2 > j) flag = 1;
    if (flag) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    for (long long int i = 0; i < v.size(); i++) {
      if (i == 0)
        cout << "RUN " << v[i].first - 1 << "\n";
      else
        cout << "RUN " << v[i].first - v[i - 1].second - 2 << "\n";
      cout << "JUMP " << v[i].second - v[i].first + 2 << "\n";
    }
    if (m - v[v.size() - 1].second != 1)
      cout << "RUN " << m - v[v.size() - 1].second - 1 << "\n";
  }
  return 0;
}
