func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     vector<int> bariers;     int n, m, s, d, temp;     scanf( %d%d%d%d , &n, &m, &s, &d);     for (int i = 0; i < n; i++) {       scanf( %d , &temp);       bariers.push_back(temp);     }     sort(bariers.begin(), bariers.end());     int sing_dist, temp_dist = 0;     if (bariers[0] <= s || d == 1) {       printf( IMPOSSIBLE );       return 0;     }     for (int i = 0; i < bariers.size() - 1; i++) {       sing_dist = bariers[i + 1] - bariers[i];       if (sing_dist <= s + 1) {         bariers.erase(bariers.begin() + i);         temp_dist += sing_dist;         i--;       } else {         temp_dist = 0;       }       if (temp_dist + 1 >= d) {         printf( IMPOSSIBLE );         return 0;       }     }     int cur_pos = 0;     for (int i = 0; i < bariers.size(); i++) {       temp_dist = bariers[i] - d - s + 1;       if (cur_pos < temp_dist) {         printf( RUN %d n , temp_dist + s - cur_pos);         printf( JUMP %d n , d);       } else {         printf( RUN %d n , s);         printf( JUMP %d n , bariers[i] + 1 - cur_pos - s);       }       cur_pos = bariers[i] + 1;     }     if (cur_pos != m) {       printf( RUN %d n , m - cur_pos);     }     return 0;   }   