#include <bits/stdc++.h>
using namespace std;
inline int IMPOSIBLE() {
  printf("IMPOSSIBLE\n");
  return 0;
}
int main() {
  int n, m, s, d;
  scanf("%i %i %i %i", &n, &m, &s, &d);
  if (d < 2) return IMPOSIBLE();
  vector<int> v(n);
  for (int& it : v) scanf("%i", &it);
  sort(v.begin(), v.end());
  vector<int> ans;
  if (v[0] <= s) return IMPOSIBLE();
  int now = v[0] - 1;
  ans.push_back(now);
  int to_jump(1);
  for (int i = 1; i < n; ++i) {
    if (v[i] - v[i - 1] - 1 > s)
      to_jump += 1, ans.push_back(to_jump), now += to_jump,
          to_jump = 1, ans.push_back(v[i] - v[i - 1] - 2),
          now += v[i] - v[i - 1] - 2;
    else
      to_jump += v[i] - v[i - 1];
    if (to_jump + 1 > d) return IMPOSIBLE();
  }
  ans.push_back(to_jump + 1);
  now += (to_jump + 1);
  if (now < m) ans.push_back(m - now);
  for (int i = 0; i < ans.size(); ++i) {
    if (i & 1)
      printf("JUMP %i\n", ans[i]);
    else
      printf("RUN %i\n", ans[i]);
  }
  return 0;
}
