#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int INF = 2e9;
int a[N];
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  n++;
  for (int i = (1); (i) < (n); ++i) cin >> a[i];
  sort(a, a + n);
  a[0] = -1;
  int max_x = 0;
  for (int i = 0; (i) < (n); ++i) {
    if (max_x <= a[i]) break;
    if (i == n - 1) {
      max_x = INF;
      break;
    }
    if (a[i] + 1 + s < a[i + 1]) {
      if (max_x < a[i + 1] - 1 + d) {
        max_x = a[i + 1] - 1 + d;
        ans.push_back(i);
      }
    }
  }
  if (max_x < m) {
    puts("IMPOSSIBLE");
    return 0;
  }
  int x = 0;
  for (int i = 0; (i) < ((int)((ans).size())); ++i) {
    int to = a[ans[i] + 1] - 1, next;
    if (i < (int)((ans).size()) - 1)
      next = a[ans[i + 1]] + 1;
    else
      next = min(m, a[n - 1] + 1);
    cout << "RUN " << to - x << '\n';
    cout << "JUMP " << next - to << '\n';
    cout.flush();
    assert(to - x >= s && next - to > 0 && next - to <= d);
    x = next;
  }
  if (m != x) {
    cout << "RUN " << m - x << '\n';
  }
  return 0;
}
