#include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <queue>

 using namespace std;

 , INF=0x7fffffff;

 struct Splay_Tree {
     struct Node {
         ];
         bool rev;
         inline void init(int _val) {
             val=_val, Size=;
             son[]=son[]=rev=;
         }
     } T[N];
     int fa[N], root;
     queue <int> ans;

     inline void pushUp(int x) {
         T[x].Size=;
         ]) T[x].Size+=T[T[x].son[]].Size;
         ]) T[x].Size+=T[T[x].son[]].Size;
     }

     inline void pushDown(int x) {
         if(!T[x].rev) return;
         ]) T[T[x].son[]].rev^=;
         ]) T[T[x].son[]].rev^=;
         swap(T[x].son[], T[x].son[]);
         T[x].rev=;
     }

     void Rotate(int x, int kind) {
         int y=fa[x], z=fa[y];
         pushDown(y), pushDown(x);
         T[y].son[!kind]=T[x].son[kind], fa[T[x].son[kind]]=y;
         T[x].son[kind]=y, fa[y]=x;
         T[z].son[T[z].son[]==y]=x, fa[x]=z;
         pushUp(y);
     }

     void Splay(int x, int goal) {
         if(x==goal) return;
         while(fa[x]!=goal) {
             int y=fa[x], z=fa[y];
             ]==x, ry=T[z].son[]==y;
             if(z==goal) Rotate(x, rx);
             else {
                 if(rx==ry) Rotate(y, ry);
                 else Rotate(x, rx);
                 Rotate(x, ry);
             }
         }
         pushUp(x);
         ) root=x;
     }

     int Select(int pos, int goal) {
         int u=root;
         pushDown(u);
         ]].Size!=pos) {
             ]].Size>pos) u=T[u].son[];
             else {
                 pos-=T[T[u].son[]].Size+;
                 u=T[u].son[];
             }
             pushDown(u);
         }
         Splay(u, goal);
         return u;
     }

     void Cut(int L, int R, int pos) {
         , ), v=Select(R+, u);
         ];
         fa[x]=, T[v].son[]=;
         Splay(v, );
         u=Select(pos, ), v=Select(pos+, u);
         T[v].son[]=x, fa[x]=v;
         Splay(x, );
     }

     void Reverse(int L, int R) {
         , ), v=Select(R+, u);
         T[T[v].son[]].rev^=;
     }

     void DFS(int u) {
         pushDown(u);
         ]) DFS(T[u].son[]);
         ans.push(T[u].val);
         ]) DFS(T[u].son[]);
     }

     void Display(int n) {
         while(!ans.empty()) ans.pop();
         DFS(root);
         , x; cnt<n; cnt++, ans.pop()) {
             for(x=ans.front(); x==-INF; ans.pop(), x=ans.front());
             printf("%d", x);
             ==n) printf("\n");
             else printf(" ");
         }
     }

     int build(int L, int R) {
         ;
         if(L==R) return L;
         , sL, sR;
         T[mid].son[]=sL=build(L, mid-);
         T[mid].son[]=sR=build(mid+, R);
         fa[sL]=fa[sR]=mid;
         pushUp(mid);
         return mid;
     }

     void init(int n) {
         T[].init(-INF), T[].init(-INF), T[n+].init(-INF);
         ; i<=n+; i++) T[i].init(i-);
         root=build(, n+);
         T[].Size=, T[].son[]=root, fa[root]=, fa[]=;
     }
 } hehe;
 int n, m;
 ];

 int main() {
 //    freopen("in", "r", stdin);
      || m!=-) {
         hehe.init(n);
         , a, b, c; i<m; i++) {
             scanf("%s", cmd);
             ]=='C') {
                 scanf("%d%d%d", &a, &b, &c);
                 hehe.Cut(a, b, c);
             }
             else {
                 scanf("%d%d", &a, &b);
                 hehe.Reverse(a, b);
             }
         }
         hehe.Display(n);
     }
     ;
 }