#include <bits/stdc++.h>
using namespace std;
const long long INF = 999999;
int main() {
  long long n, m, s, d, tmp, len;
  cin >> n >> m >> s >> d;
  vector<long long> a(n, 0);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (d < 2) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  sort(a.begin(), a.end());
  vector<long long> next(n);
  vector<bool> norm(n, 0), what;
  long long prev = -1;
  for (long long i = n - 1; i > -1; i--) {
    if (i == 0) {
      if (a[i] - 1 >= s) {
        norm[i] = 1;
      }
      next[i] = prev;
    } else {
      if (a[i] - a[i - 1] - 2 >= s) {
        norm[i] = 1;
        next[i] = prev;
        prev = i;
      } else {
        next[i] = prev;
      }
    }
  }
  vector<long long> ans;
  bool flag = false;
  long long pr, next1;
  for (long long i = 0; i < n + 1; i++) {
    if (i == n) {
      if (!norm[i - 1]) {
        flag = true;
        break;
      }
      what.push_back(1);
      ans.push_back(2);
      if (m - a[i - 1] - 1 > 0) {
        what.push_back(0);
        ans.push_back(m - a[i - 1] - 1);
      }
    } else if (!norm[i]) {
      if (i == 0) {
        flag = true;
        break;
      }
      pr = i - 1;
      next1 = next[pr];
      pr = a[pr];
      if (next1 == -1)
        next1 = a[n - 1];
      else
        next1 = a[next1 - 1];
      tmp = next1 - pr + 2;
      if (tmp > d) {
        flag = true;
        break;
      }
      what.push_back(1);
      ans.push_back(tmp);
      if (next[i - 1] == -1) {
        if (m - a[n - 1] - 1 > 0) {
          what.push_back(0);
          ans.push_back(m - a[n - 1] - 1);
        }
        i = n;
      } else {
        i = next[i - 1] - 1;
      }
    } else {
      if (i == 0) {
        what.push_back(0);
        ans.push_back(a[0] - 1);
      } else {
        len = (long long)what.size();
        if (!what[len - 1]) {
          what.push_back(1);
          ans.push_back(2);
          what.push_back(0);
          ans.push_back(a[i] - a[i - 1] - 2);
        } else {
          what.push_back(0);
          ans.push_back(a[i] - a[i - 1] - 2);
        }
      }
    }
  }
  if (flag) {
    cout << "IMPOSSIBLE";
    return 0;
  }
  for (long long i = 0; i < (long long)what.size(); i++) {
    if (what[i]) {
      cout << "JUMP " << ans[i] << endl;
    } else {
      cout << "RUN " << ans[i] << endl;
    }
  }
  return 0;
}
