#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > gd;
vector<pair<string, int> > ans;
int a[200005];
int main() {
  int n, m, s, d, i;
  cin >> n >> m >> s >> d;
  for (i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  gd.push_back({0, a[0] - 1});
  for (i = 0; i < n - 1; i++) {
    if (a[i + 1] - a[i] - 2 >= s && a[i + 1] != a[i] + 1)
      gd.push_back({a[i] + 1, a[i + 1] - a[i] - 2});
  }
  gd.push_back({a[i] + 1, (int)2e9});
  for (i = 0; i < gd.size() - 1; i++) {
    int d1 = gd[i + 1].first - gd[i].first - gd[i].second;
    if (d1 <= d && gd[i].second >= s) {
      ans.push_back({"RUN", gd[i].second});
      ans.push_back({"JUMP", d1});
    } else {
      cout << "IMPOSSIBLE";
      return 0;
    }
  }
  if (m - gd[gd.size() - 1].first > 0)
    ans.push_back({"RUN", m - gd[gd.size() - 1].first});
  for (i = 0; i < ans.size(); i++)
    cout << ans[i].first << " " << ans[i].second << endl;
  return 0;
}
