#include <bits/stdc++.h>
using namespace std;
bool canGo(vector<int> &n1, int &l, vector<int> &m1) {
  if ((n1[3] - n1[2]) <= n1[0]) return false;
  if (l > n1[1]) return false;
  m1.push_back(0);
  m1.push_back(n1[3] - 1);
  for (int k = 3; k < n1.size() - 1; k++) {
    if ((n1[k + 1] - n1[k] - 1) <= n1[0])
      l += n1[k + 1] - n1[k];
    else {
      m1.push_back(n1[k] + 1);
      m1.push_back(n1[k + 1] - 1);
      l = 2;
    }
    if (l > n1[1]) {
      return false;
    }
  }
  return true;
}
int main() {
  int n, m, s, d, t, l = 2;
  cin >> n >> m >> s >> d;
  set<int> myset;
  vector<int> n1, m1;
  n1.push_back(s);
  n1.push_back(d);
  n1.push_back(0);
  for (int i = 0; i < n; i++) {
    cin >> t;
    myset.insert(t);
  }
  for (set<int>::iterator it = myset.begin(); it != myset.end(); ++it)
    n1.push_back(*it);
  if (!canGo(n1, l, m1)) {
    cout << "IMPOSSIBLE";
  } else {
    m1.push_back(n1[n1.size() - 1] + 1);
    if (n1[n1.size() - 1] + 1 < m) m1.push_back(m);
    for (int i = 0; i < m1.size() - 1; i++) {
      if (i % 2 == 0) {
        cout << "RUN " << m1[i + 1] - m1[i] << endl;
      } else {
        cout << "JUMP " << m1[i + 1] - m1[i] << endl;
      }
    }
  }
}
