#include <bits/stdc++.h>
using namespace std;
int a[200005];
int p[200005];
int f[200005];
int ptr;
int main() {
  int n, m, s, d;
  scanf("%d%d%d%d", &n, &m, &s, &d);
  a[0] = -1;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++)
    if (a[i] - a[i - 1] - 2 >= s) p[ptr] = a[i - 1] + 1, f[ptr++] = a[i] - 1;
  if (s >= a[1]) {
    printf("IMPOSSIBLE");
    return 0;
  }
  for (int i = 1; i < ptr; i++)
    if (p[i] - f[i - 1] > d) {
      printf("IMPOSSIBLE");
      return 0;
    }
  if (a[n] + 1 - f[ptr - 1] > d) {
    printf("IMPOSSIBLE");
    return 0;
  }
  printf("RUN %d\n", f[0] - p[0]);
  for (int i = 1; i < ptr; i++) {
    printf("JUMP %d\n", p[i] - f[i - 1]);
    printf("RUN %d\n", f[i] - p[i]);
  }
  printf("JUMP %d\n", a[n] + 1 - f[ptr - 1]);
  if (a[n] + 1 < m) printf("RUN %d\n", m - a[n] - 1);
  return 0;
}
