#include <bits/stdc++.h>
using namespace std;
vector<pair<string, int> > p;
int main() {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  int i = 0;
  int f = 0;
  int l = 0;
  while (f == 0 && i < n) {
    if ((a[i] - l - 1) < s) f = 1;
    int pr = 2;
    p.push_back(make_pair("RUN", a[i] - 1 - l));
    l = a[i] + 1;
    i++;
    while (a[i] - l - 1 < s && i < n) pr += (a[i] - l + 1), l = a[i] + 1, i++;
    if (pr > d) f = 1;
    p.push_back(make_pair("JUMP", pr));
    if (l > m) f = 1;
  }
  if (f == 1) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  if (l != m) p.push_back(make_pair("RUN", m - l));
  for (int i = 0; i < p.size(); i++)
    cout << p[i].first << ' ' << p[i].second << endl;
}
