#include <bits/stdc++.h>
using namespace std;
vector<long long> answer;
long long am[2002001];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, s, d, r, id, i;
  cin >> n >> m >> s >> d;
  if (d < 2) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  am[0] = -1;
  for (i = 1; i <= n; i++) cin >> am[i];
  sort(am, am + 1 + n);
  for (i = 1; i <= n; i++) {
    r = (am[i] - 1) - (am[i - 1] + 1);
    if (r < s) {
      cout << "IMPOSSIBLE";
      return 0;
    }
    answer.push_back(-r);
    id = i + 1;
    while ((id <= n) && ((am[id] - 1) - (am[id - 1] + 1) < s) &&
           ((am[id] + 1) - (am[i] - 1) <= d))
      id++;
    id--;
    if ((id == n) && ((am[n] + 1) - (am[i] - 1) <= d)) {
      answer.push_back((am[n] + 1) - (am[i] - 1));
      i = id;
    } else if ((id < n) && (am[id + 1] - am[id] - 1 >= s) &&
               (am[id] - am[i] + 2 <= d)) {
      answer.push_back((am[id] + 1) - (am[i] - 1));
      i = id;
    } else {
      cout << "IMPOSSIBLE";
      return 0;
    }
  }
  answer.push_back(-(m - (am[n] + 1)));
  for (i = 0; i < answer.size(); i++) {
    if (answer[i] < 0)
      cout << "RUN " << -answer[i] << '\n';
    else if (answer[i] > 0)
      cout << "JUMP " << answer[i] << '\n';
  }
  return 0;
}
