#include <cstdio>
#include <cstdlib>
#include <time.h>
typedef struct _Treap {
_Treap *l, *r;
int key, pr, size;
bool lazy;
_Treap(int k) {
key = k;
pr = rand() ^ rand();
size = 1;
lazy = false;
l = r = NULL;
}
~_Treap() {delete l; delete r;};
void recalc() {
size = 1;
prop();
if(l != NULL) size += l -> size;
if(r != NULL) size += r -> size;
}
void prop() {
if(lazy == true) {
lazy = false;
_Treap *aux;
aux = l;
l = r;
r = aux;
if(l != NULL) l -> lazy ^= 1;
if(r != NULL) r -> lazy ^= 1;
}
}
} *Treap;
void recalc(Treap x) { if(x != NULL) x -> recalc(); }
int getSize(Treap x) {
if(x == NULL) return 0;
recalc(x);
return x -> size;
}
void split(Treap x, int p, Treap &l, Treap &r, int extra) {
l = r = NULL;
if(x == NULL) return ;
recalc(x);
int poz = 1 + extra + getSize(x -> l);
if(poz < p) {
split(x -> r, p, x -> r, r, poz);
l = x;
recalc(l);
} else {
split(x -> l, p, l, x -> l, extra);
r = x;
recalc(r);
}
}
Treap join(Treap l, Treap r) {
if(l == NULL) return r;
if(r == NULL) return l;
recalc(l);
recalc(r);
if(l -> pr < r -> pr) {
l -> r = join(l -> r, r);
recalc(l);
return l;
} else {
r -> l = join(l, r -> l);
recalc(r);
return r;
}
}
Treap add(Treap x, int k, int e) {
Treap l, r;
split(x, k, l , r, 0);
return join(join(l, new _Treap(e)), r);
}
Treap erase(Treap x, int p1, int p2) {
Treap l, mid, r;
split(x, p2 + 1, mid, r, 0);
split(mid, p1, l, mid, 0);
delete mid;
return join(l, r);
}
Treap reverse(Treap x, int p1, int p2) {
Treap l, mid, r;
split(x, p2 + 1, mid, r, 0);
split(mid, p1, l, mid, 0);
mid -> lazy = true;
return join(join(l, mid), r);
}
int acces(Treap x, int k, int extra) {
int poz;
recalc(x);
poz = 1 + extra + getSize(x -> l);
if(poz == k)
return x -> key;
else if(poz < k)
return acces(x -> r, k, poz);
else
return acces(x -> l, k, extra);
}
int main() {
srand(time(NULL));
int n, bit, a1, a2;
char ch;
Treap t = NULL;
FILE *fin = fopen("secv8.in", "r");
FILE *fout = fopen("secv8.out", "w");
fscanf(fin, "%d%d", &n, &bit);
for(int i = 0; i < n; ++i) {
ch = fgetc(fin);
while(ch == ' ' || ch == '\n')
ch = fgetc(fin);
if(ch == 'I') {
fscanf(fin, "%d%d", &a1, &a2);
t = add(t, a1, a2);
} else if(ch == 'D') {
fscanf(fin, "%d%d", &a1, &a2);
t = erase(t, a1, a2);
} else if(ch == 'R') {
fscanf(fin, "%d%d", &a1, &a2);
t = reverse(t, a1, a2);
} else if(ch == 'A') {
fscanf(fin, "%d", &a1);
fprintf(fout, "%d\n", acces(t, a1, 0));
}
}
n = getSize(t);
for(int i = 1; i <= n; ++i)
fprintf(fout, "%d ", acces(t, i, 0));
fclose(fin);
fclose(fout);
return 0;
}