#include <bits/stdc++.h>
using namespace std;
int n, m, s, d;
const int MAXN = 200005;
int arr[MAXN];
int ne[MAXN];
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m >> s >> d;
  for (int g = 1; g <= n; g++) cin >> arr[g];
  sort(arr + 1, arr + n + 1);
  vector<int> pos;
  pos.push_back(0);
  for (int g = 1; g <= n; g++) pos.push_back(arr[g] + 1);
  int la = pos.size() - 1;
  for (int g = pos.size() - 2; g >= 0; g--) {
    if (pos[g + 1] - 2 - pos[g] < s) continue;
    if (pos[la] - (pos[g + 1] - 2) <= d) {
      ne[g] = la;
      la = g;
    }
  }
  if (la == 0) {
    int nz = 0;
    while (nz != pos.size() - 1) {
      cout << "RUN " << pos[nz + 1] - 2 - pos[nz] << '\n';
      cout << "JUMP " << pos[ne[nz]] - (pos[nz + 1] - 2) << '\n';
      nz = ne[nz];
    }
    if (m - pos.back() > 0) cout << "RUN " << m - pos.back() << '\n';
  } else
    cout << "IMPOSSIBLE" << '\n';
  return 0;
}
