Give Me the Order

#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int N,M,a,I,b;
rope<int> S,h;
int main(void){
    scanf("%d",&N);
    F(N)scanf("%d",&a),S.PB(a);
    IN(M)F(M)
        scanf("%d%d",&a,&b),--a,--b,
        h=S.substr(a,b-a+1),
        S.erase(a,b-a+1),
        S.insert(S.mutable_begin(),h);
    for(rope <int>::iterator it=S.mutable_begin();it!=S.mutable_end();++it)
        printf("%d%c",(int)*it,++I^N?32:10);
//    for(auto&h:S)printf("%d%c",h,++I^N?32:10);
    return 0;
}