#include <bits/stdc++.h>
using namespace std;
int main() {
  long long m, n, s, d, i;
  cin >> n >> m >> s >> d;
  vector<long long> a;
  a.resize(n + 1);
  vector<string> ans;
  vector<long long> num;
  for (i = 0; i < n; i++) cin >> a[i];
  a[n] = -1;
  sort(a.begin(), a.end());
  long long last = m;
  long long razb;
  if (a[n] < m - 1) {
    ans.push_back("RUN ");
    num.push_back(m - a[n] - 1);
    last = a[n] + 1;
  }
  bool f = true;
  razb = a[n] - 1;
  for (i = n; i > 0; i--) {
    if (razb - a[i - 1] - 1 >= s && last - razb <= d) {
      ans.push_back("JUMP ");
      num.push_back(last - razb);
      ans.push_back("RUN ");
      num.push_back(razb - a[i - 1] - 1);
      last = a[i - 1] + 1;
      razb = a[i - 1] - 1;
    } else if (razb - a[i - 1] - 1 < s && i - 1 > 0)
      razb = a[i - 1] - 1;
    else
      f = false;
  }
  if (!f)
    cout << "IMPOSSIBLE" << endl;
  else
    for (i = ans.size() - 1; i >= 0; i--) cout << ans[i] << num[i] << endl;
}
