func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long INF = 2e18 + 33;   const int MX = 2 * 1e5 + 11;   long long N, M, k, s, d;   int arr[MX];   vector<pair<int, int> > v;   int main() {     cin >> N >> M >> s >> d;     for (int i = 0; i < N; i++) scanf( %d , &arr[i]);     arr[N] = M + 1;     sort(arr, arr + N + 1);     long long pos = arr[0] - 1;     if (pos < s) {       cout <<  IMPOSSIBLE n ;       return 0;     }     v.push_back(make_pair(pos, 0));     for (int i = 0; i < N; i++) {       if (i < N - 1 && arr[i + 1] - arr[i] - 2 < s) continue;       if (arr[i] - pos + 1 <= d) {         v.push_back(make_pair(arr[i] - pos + 1, 1));         v.push_back(make_pair(arr[i + 1] - arr[i] - 2, 0));         pos = arr[i + 1] - 1;       }     }     if (pos < M)       cout <<  IMPOSSIBLE n ;     else       for (int i = 0; pos >= M && i < v.size(); i++) {         if (v[i].first == 0) continue;         if (v[i].second == 1)           cout <<  JUMP  ;         else           cout <<  RUN  ;         cout << v[i].first <<   n ;       }     return 0;   }   