#include <bits/stdc++.h>
using namespace std;
const string r = "RUN", j = "JUMP", IMP = "IMPOSSIBLE";
int main() {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n >= 0 && d <= 1) {
    cout << IMP << endl;
    return 0;
  }
  sort(a, a + n);
  vector<pair<int, int> > seg;
  int fa = a[0], sa = a[0];
  if (a[0] <= s) {
    cout << IMP << endl;
    return 0;
  }
  for (int i = 1; i < n; i++) {
    if (a[i] - a[i - 1] <= s + 1)
      sa = a[i];
    else {
      if (sa - fa > d - 2) {
        cout << IMP << endl;
        return 0;
      }
      seg.push_back({fa, sa});
      sa = fa = a[i];
    }
    if (i == n - 1) {
      seg.push_back({fa, sa});
      if (sa - fa > d - 2) {
        cout << IMP << endl;
        return 0;
      }
    }
  }
  if (n == 1) seg.push_back({fa, sa});
  for (int i = 0; i < seg.size(); i++) {
    cout << r << ' ' << (seg[i].first - (i > 0 ? seg[i - 1].second : -1) - 2)
         << endl;
    cout << j << ' ' << (seg[i].second - seg[i].first + 2) << endl;
  }
  if (m - seg[seg.size() - 1].second - 1)
    cout << r << ' ' << m - seg[seg.size() - 1].second - 1 << endl;
  return 0;
}
