#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
const int logn = 17;
const int inf = (int)1e9;
const long long mod = (int)1e9 + 7;
const long long l_inf = (long long)4e18;
const long double pi = acosl(-1.0);
const long double eps = 1e-9;
int n, m, s, d;
int x[maxn];
vector<pair<string, int> > ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(15);
  cout << fixed;
  srand(566);
  cin >> n >> m >> s >> d;
  for (int i = 0; i < n; i++) cin >> x[i];
  sort(x, x + n);
  int myX = 0;
  for (int i = 0, j = 0; i < n; i = ++j) {
    if (x[i] - myX - 1 < s) {
      cout << "IMPOSSIBLE";
      exit(0);
    }
    ans.push_back(make_pair("RUN", x[i] - myX - 1));
    myX = x[i] - 1;
    while (j + 1 < n && x[j + 1] - x[j] - 2 < s) j++;
    if (x[j] + 1 - myX > d) {
      cout << "IMPOSSIBLE";
      exit(0);
    }
    ans.push_back(make_pair("JUMP", x[j] + 1 - myX));
    myX = x[j] + 1;
  }
  if (myX < m) ans.push_back(make_pair("RUN", m - myX));
  for (pair<string, int> a : ans) cout << a.first << ' ' << a.second << '\n';
  return 0;
}
