#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5;
int main() {
  long long n, m, s, d;
  cin >> n >> m >> s >> d;
  long long a[n + 1];
  for (int i = 1; i <= n; i++) cin >> a[i];
  vector<pair<string, int> > ans;
  sort(a + 1, a + n + 1);
  a[0] = 0;
  for (int i = 1, j; i <= n; i = j) {
    j = i;
    int run;
    if (i == 1)
      run = a[i] - a[i - 1] - 1;
    else
      run = a[i] - a[i - 1] - 2;
    if (run < s) {
      cout << "IMPOSSIBLE";
      return 0;
    } else {
      ans.push_back({"RUN", run});
      int jumpstart = a[i] - 1;
      j++;
      while ((j <= n) && ((a[j] - a[j - 1] - 2) < s)) j++;
      int jumpend = a[j - 1] + 1;
      int jump = jumpend - jumpstart;
      if (jump > d) {
        cout << "IMPOSSIBLE";
        return 0;
      } else
        ans.push_back({"JUMP", jump});
    }
  }
  if ((m - a[n] - 1) > 0) ans.push_back({"RUN", m - a[n] - 1});
  for (int i = 0; i < ans.size(); i++)
    cout << ans[i].first << " " << ans[i].second << "\n";
  return 0;
}
