#include <bits/stdc++.h>
using namespace std;
long long a[5000005], r, m, n;
vector<pair<long long, long long> > v;
int main() {
  ios_base::sync_with_stdio(0);
  long long k = 0, t = 0, x, sum = 0, z = 0, y = 0, l = 1, i, j;
  cin >> n >> m >> x >> l;
  for (i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  k = a[0] - 1;
  i = 1;
  if (a[0] <= x || l <= 1) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  while (i < n) {
    if (a[i] - a[i - 1] > x + 1)
      v.push_back(make_pair(k, a[i - 1] + 1)), k = a[i] - 1;
    else if (a[i] - k + 1 > l) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    i++;
  }
  v.push_back(make_pair(k, a[i - 1] + 1));
  k = v[0].first;
  cout << "RUN " << k << endl;
  for (i = 0; i < v.size(); i++) {
    cout << "JUMP " << v[i].second - v[i].first << endl;
    if (i < v.size() - 1)
      cout << "RUN " << v[i + 1].first - v[i].second << endl;
  }
  if (m - v[i - 1].second != 0) cout << "RUN " << m - v[i - 1].second << endl;
  return 0;
}
