#include <bits/stdc++.h>
using namespace std;
int n, m, s, d, o[200001];
list<pair<int, int>> obs;
int main() {
  scanf("%d%d%d%d", &n, &m, &s, &d);
  for (int i = 0; i < n; ++i) scanf("%d", o + i);
  sort(o, o + n);
  obs.emplace_back(-1, -1);
  for (int i = 0; i < n; ++i)
    if (o[i] == obs.back().second + 1)
      ++obs.back().second;
    else
      obs.emplace_back(o[i], o[i]);
  for (auto it = next(obs.begin()), jt = obs.begin(); it != obs.end();) {
    if (it->second - it->first + 2 > d) return puts("IMPOSSIBLE"), 0;
    if (it->first - jt->second - 2 < s) {
      if (jt == obs.begin()) return puts("IMPOSSIBLE"), 0;
      it->first = jt->first;
      jt = obs.erase(jt);
      --jt;
    } else
      ++it, ++jt;
  }
  for (auto it = next(obs.begin()), jt = obs.begin(); it != obs.end();
       ++it, ++jt)
    printf("RUN %d\nJUMP %d\n", it->first - jt->second - 2,
           it->second - it->first + 2);
  if (m - obs.back().second - 1) printf("RUN %d\n", m - obs.back().second - 1);
}
