#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int INF = 1000 * 1000 * 1000 + 322;
const long long LLINF =
    2LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const long long MOD = 1000 * 1000 * 1000 + 7;
const int RMOD = MOD - 2;
const int N = 200 * 1000 + 10;
const int P1M = 1336337;
const int P1K = 1009;
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
  _out << _p.first << ' ' << _p.second;
  return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
  _in >> _p.first >> _p.second;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
  if (_v.empty()) return _out;
  _out << _v.front();
  for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) _in >> _i;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
  if (_s.empty()) return _out;
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
  if (_m.empty()) return _out;
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
    _out << ", (" << _it->first << ": " << _it->second << ')';
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
  if (_m.empty()) return _out;
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
    _out << ", (" << _it->first << ": " << _it->second << ')';
  return _out;
}
const char *infile = "";
const char *outfile = "";
inline int gcd(int a, int b) {
  while (b) {
    int tmp = a % b;
    a = b;
    b = tmp;
  }
  return a;
}
inline long long lcm(int a, int b) {
  return (long long)a * (long long)b / gcd(a, b);
}
inline long long pwm(long long xx, long long pow) {
  long long mlt = 1;
  while (pow) {
    if (pow & 1) {
      mlt *= xx;
      xx *= xx;
      pow >>= 1;
      xx %= MOD;
      mlt %= MOD;
    } else {
      pow >>= 1;
      xx *= xx;
      xx %= MOD;
    }
  }
  return mlt;
}
inline long long pw(long long xx, int pow) {
  long long mlt = 1;
  while (pow) {
    if (pow & 1) {
      mlt *= xx;
      xx *= xx;
      pow >>= 1;
    } else {
      pow >>= 1;
      xx *= xx;
    }
  }
  return mlt;
}
inline long long inv(long long r) { return pwm(r, RMOD); }
vector<pair<int, int>> G[N];
vector<int> cl[N];
int m_deg = 0;
void dfs(int v, int pr, int bn) {
  int clr = 0;
  for (auto &i : G[v]) {
    if (clr == bn) ++clr;
    if (i.first == pr) continue;
    cl[clr].push_back(i.second);
    dfs(i.first, v, clr);
    ++clr;
  }
  m_deg = max(m_deg, clr);
}
inline void solve(long double tt) {
  int n, m, s, d;
  cin >> n >> m >> s >> d;
  vector<int> obst(n);
  cin >> obst;
  sort((obst).begin(), (obst).end());
  int cur_ps = obst[0] - 1, nxt_obst = 0;
  vector<pair<bool, int>> ans;
  if (cur_ps > 0) ans.push_back({false, cur_ps});
  if (cur_ps < s) {
    cout << "IMPOSSIBLE\n";
    return;
  }
  while (nxt_obst != n) {
    if (obst[n - 1] + 1 - cur_ps <= d) {
      ans.push_back({true, obst[n - 1] + 1 - cur_ps});
      if (m - obst[n - 1] - 1 > 0) ans.push_back({false, m - obst[n - 1] - 1});
      break;
    }
    int jmp = 2;
    while (jmp <= d && obst[nxt_obst + 1] - obst[nxt_obst] - 2 < s) {
      ++nxt_obst;
      jmp = obst[nxt_obst] + 1 - cur_ps;
    }
    if (jmp > d) {
      cout << "IMPOSSIBLE\n";
      return;
    }
    ++nxt_obst;
    ans.push_back({true, jmp});
    cur_ps += jmp;
    if (obst[nxt_obst] - cur_ps - 1 > 0)
      ans.push_back({false, obst[nxt_obst] - cur_ps - 1});
    cur_ps = obst[nxt_obst] - 1;
  }
  for (auto &i : ans) {
    if (i.first) {
      cout << "JUMP " << i.second << "\n";
    } else {
      cout << "RUN " << i.second << "\n";
    }
  }
}
int main() {
  long double tt = clock();
  if (*infile != '\0') freopen(infile, "r", stdin);
  if (*outfile != '\0') freopen(outfile, "w", stdout);
  cout << setprecision(20);
  cout << fixed;
  solve(tt);
  return 0;
}
