#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((long long)new char);
const double eps = 1e-8;
const int maxn = 200010;
const long double INF = 1e15;
const int mod = 1e9 + 7;
const int li = 2;
int n, m, s, d;
int a[maxn];
vector<pair<string, int>> ans;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> s >> d;
  for (int t = (1); t < (n + 1); ++t) cin >> a[t];
  sort(a + 1, a + n + 1);
  a[0] = 0;
  int i = 0, la = 0;
  bool gg = 0;
  for (int t = (1); t < (n + 1); ++t) {
    if (a[t] - la < s + 1) {
      gg = 1;
      break;
    }
    ans.push_back({"RUN", a[t] - la - 1});
    int l = a[t] - 1, r = a[t] + 1;
    while (t < n && a[t + 1] - a[t] < s + 2) ++t, r = a[t] + 1;
    if (r - l > d) {
      gg = 1;
      break;
    }
    ans.push_back({"JUMP", r - l});
    la = r;
  }
  if (gg)
    cout << "IMPOSSIBLE\n";
  else {
    if (a[n] < m - 1) ans.push_back({"RUN", m - a[n] - 1});
    for (auto r : ans) cout << r.first << " " << r.second << "\n";
  }
}
