1 #include <stdio.h>
 2 #include <string.h>
 3 #define MAXN 1000005
 4 int cas,n,m,x[MAXN],l,r,tu;
 5 int stkl[MAXN],stkr[MAXN],topl,topr;
 6 int dq[MAXN*2],front,rear;
 7 struct list_q{
 8     int dir;
 9     void init(int l,int r,int n,int *x){
10         dir=0,topl=topr=0,front=MAXN,rear=MAXN-1;
11         for(int i=1;i<l;i++)stkl[++topl]=x[i];
12         for(int i=l;i<=r;i++)dq[++rear]=x[i];
13         for(int i=n;i>r;i--)stkr[++topr]=x[i];
14     }
15     void moveLR(char d,char p){
16         if(d=='L'&&p=='L')dq[dir?++rear:--front]=stkl[topl--];
17         else if(d=='L'&&p=='R')stkr[++topr]=dq[dir?front++:rear--];
18         else if(d=='R'&&p=='L')stkl[++topl]=dq[dir?rear--:front++];
19         else if(d=='R'&&p=='R')dq[dir?--front:++rear]=stkr[topr--];
20     }
21     void insert(char p,int v){
22         if(dir==0&&p=='R'||dir==1&&p=='L')dq[++rear]=v;
23         else dq[--front]=v;
24     }
25     void delet(char &p){
26         if(dir==0&&p=='R'||dir==1&&p=='L')rear--;
27         else front++;
28     }
29     void reverse(){dir^=1;}
30     void outans(int *x){
31         int p=0;
32         for(int i=1;i<=topl;i++)x[++p]=stkl[i];
33         for(int i=front;i<=rear;i++)x[++p]=dir?dq[rear-i+front]:dq[i];
34         for(int i=topr;i>0;i--)x[++p]=stkr[i];
35         for(int i=1;i<p;i++)printf("%d ",x[i]);printf("%d\n",x[p]);
36     }
37 };
38 char s1[15],s2[15];
39 int main(){
40     //freopen("test.in","r",stdin);
41     scanf("%d",&cas);
42     while(cas--){
43         list_q qq;
44         scanf("%d",&n);
45         for(int i=1;i<=n;i++)scanf("%d",&x[i]);
46         scanf("%d%d%d",&l,&r,&m);
47         qq.init(l,r,n,x);
48         for(int i=1;i<=m;i++){
49             scanf("%s",s1);
50             if(s1[0]!='R')scanf("%s",s2);
51             if(s1[0]=='I')scanf("%d",&tu);
52             switch(s1[0]){
53                 case 'M':qq.moveLR(s1[4],s2[0]);break;
54                 case 'I':qq.insert(s2[0],tu);break;
55                 case 'D':qq.delet(s2[0]);break;
56                 case 'R':qq.reverse();break;
57             }
58         }
59         qq.outans(x);
60     }
61 return 0;
62 }