#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:2899887000")
using namespace std;
const int K = 400;
const int MAXN = 200000 + K;
int sz;
char arr[MAXN];
int sum_blocks[MAXN];
void build(const vector<char> &g) {
  for (int i = 0; i < sz; ++i) {
    arr[i] = g[i];
    sum_blocks[i / K] += arr[i];
  }
}
int mark(int left, int right) {
  int left_block = left / K, right_block = right / K;
  if (left_block == right_block) {
    for (int i = right; i >= left; --i)
      if (arr[i] == 1) {
        sum_blocks[left_block]--;
        arr[i] = 0;
        return i;
      }
  } else {
    for (int i = right; i >= right_block * K; --i)
      if (arr[i] == 1) {
        sum_blocks[right_block]--;
        arr[i] = 0;
        return i;
      }
    for (int i = right_block - 1; i > left_block; --i)
      if (sum_blocks[i] > 0) {
        for (int j = (i + 1) * K - 1; j >= i * K; --j)
          if (arr[j] == 1) {
            sum_blocks[i]--;
            arr[j] = 0;
            return j;
          }
        throw 1;
      }
    for (int i = (left_block + 1) * K - 1; i >= left; --i)
      if (arr[i] == 1) {
        sum_blocks[left_block]--;
        arr[i] = 0;
        return i;
      }
  }
  return -1;
}
int main() {
  int n, m, s, d;
  scanf("%d %d %d %d", &n, &m, &s, &d);
  if (d == 1) {
    puts("IMPOSSIBLE");
    return 0;
  }
  vector<int> barrier(1 + n + 1);
  barrier[0] = -1;
  barrier[n + 1] = m + 1;
  for (int i = 1; i <= n; ++i) scanf("%d", &barrier[i]);
  sort(barrier.begin(), barrier.end());
  vector<char> can(1 + n + 1);
  for (int i = 0; i <= n; ++i) can[i] = (barrier[i + 1] - barrier[i] - 2 >= s);
  can[n] = 1;
  if (can[0] == 0) {
    puts("IMPOSSIBLE");
    return 0;
  }
  sz = can.size();
  build(can);
  vector<int> prev(1 + n + 1, -1);
  int pos = 0;
  while (true) {
    if (pos == n) break;
    int x = barrier[pos + 1] - 1 + d;
    int left = pos, right = sz - 1;
    while (right - left > 1) {
      int mid = (left + right) >> 1;
      if (barrier[mid] < x)
        left = mid;
      else
        right = mid;
    }
    if (left == pos) {
      puts("IMPOSSIBLE");
      return 0;
    }
    int to = mark(pos + 1, left);
    if (to == -1) {
      puts("IMPOSSIBLE");
      return 0;
    }
    prev[to] = pos;
    pos = to;
  }
  vector<int> ans;
  int v = n;
  while (v != -1) {
    ans.push_back(v);
    v = prev[v];
  }
  int szz = ans.size();
  for (int i = szz - 1; i >= 0; --i) {
    int p = barrier[ans[i] + 1];
    int k = p - barrier[ans[i]] - 2;
    if (k > 0) printf("RUN %d\n", k);
    if (k <= 0 && i - 1 >= 0) throw 1;
    if (i - 1 >= 0) printf("JUMP %d\n", barrier[ans[i - 1]] - p + 2);
  }
  return 0;
}
