#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
#define INF 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

const int CHARMAX = (1 << 10);
const int INFINT = (1LL << 32) - 1;
const ll INFLL = (1LL << 62);

class InParsare
{
private:
    FILE *fin;
    char *buffer;
    size_t index_of_buffer;

    char read_character()
    {
        index_of_buffer++;
        if(index_of_buffer == CHARMAX)
        {
            fread(buffer, 1, CHARMAX, fin);
            index_of_buffer = 0;
        }
        return buffer[index_of_buffer];
    }

public:
    InParsare(const char *name)
    {
        fin = fopen(name, "r");
        buffer = new char[CHARMAX]();
        index_of_buffer = CHARMAX - 1;
    }

    template<class T>
    InParsare &operator >> (T &n)
    {
        char c;
        while(!isdigit(c = read_character()) && c != '-');

        int sgn = 1;
        if(c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else n = c - '0';

        while(isdigit(c = read_character()))
            n = n * 10 + c - '0';
        n *= sgn;

        return *this;
    }
};

class OutParsare
{
private:
    FILE *fout;
    char *buffer;
    size_t index_of_buffer;

    void write_character(char character)
    {
        if(index_of_buffer == CHARMAX)
        {
            fwrite(buffer, 1, CHARMAX, fout);
            index_of_buffer = 0;
            buffer[index_of_buffer++] = character;
        }
        else buffer[index_of_buffer++] = character;
    }

public:

    OutParsare(const char *name)
    {
        fout = fopen(name, "w");
        buffer = new char[CHARMAX]();
        index_of_buffer = 0;
    }

    ~OutParsare()
    {
        fwrite(buffer, 1, index_of_buffer, fout);
        fclose(fout);
    }
    template<class T>
    OutParsare &operator << (T n)
    {
        if(typeid(T).name() == typeid(char).name())
        {
            write_character(n);
            return *this;
        }

        if(n <= 9)
            write_character(n + '0');
        else
        {
            (*this) << (n / 10);
            write_character(n % 10 + '0');
        }

        return *this;
    }

};

//InParsare fin("secv8.in"); /// merg numai pt numere
//OutParsare fout("secv8.out"); /// merg numai pt numere + caractere individuale, nu stringuri
ifstream fin("secv8.in");
ofstream fout("secv8.out");

struct node
{
    int val, ssize, priority;
    bool rev;
    node *left, *right;
} nil {0, 0, -1, false, 0x00, 0x00};

void set_size(node *nod)
{
    nod -> ssize = nod -> left -> ssize + nod -> right -> ssize + 1;
}

void reversion(node *nod)
{
    if(nod -> rev)
    {
        nod -> rev = 0;
        nod -> left -> rev ^= 1;
        nod -> right -> rev ^= 1;
        swap(nod -> left, nod -> right);
    }
}

node* join2(node *a, node *b)
{
    if(a == &nil) return b;
    if(b == &nil) return a;

    reversion(a);
    reversion(b);

    if(a -> priority > b -> priority)
    {
        a -> right = join2(a -> right, b);
        set_size(a);
        return a;
    }
    else
    {
        b -> left = join2(a, b -> left);
        set_size(b);
        return b;
    }
}

node* join3(node *a, node *b, node *c)
{
    return join2(a, join2(b, c));
}

pair<node*, node*> split2(node *nod, int pos)
{
    if(nod == &nil) return mp(&nil, &nil);

    reversion(nod);

    if(nod -> left -> ssize == pos)
    {
        node *temp = nod -> left;
        nod -> left = &nil;
        set_size(nod);
        return mp(temp, nod);
    }

    if(nod -> left -> ssize < pos)
    {
        auto temp = split2(nod -> right, pos - nod -> left -> ssize - 1);
        nod -> right = temp.first;
        set_size(nod);
        return mp(nod, temp.second);
    }

    if(nod -> left -> ssize > pos)
    {
        auto temp = split2(nod -> left, pos);
        nod -> left = temp.second;
        set_size(nod);
        return mp(temp.first, nod);
    }
}

tuple<node*, node*, node*> split3(node *nod, int start, int finish)
{
    auto a = split2(nod, finish);
    auto b = split2(a.first, start);
    return make_tuple(b.first, b.second, a.second);
}

node* insertion(node *nod, int pos, int val)
{
    auto temp = split2(nod, pos);
    return join3(temp.first, new node {val, 1, rand(), false, &nil, &nil}, temp.second);
}

node* removal(node *nod, int start, int finish)
{
    auto temp = split3(nod, start, finish);
    return join2(get<0>(temp), get<2>(temp));
}

node* acces(node *nod, int pos)
{
    reversion(nod);

    if(nod -> left -> ssize == pos) return nod;
    if(nod -> left -> ssize < pos) return acces(nod -> right, pos - nod -> left -> ssize - 1);
    if(nod -> left -> ssize > pos) return acces(nod -> left, pos);
}

node* real_reversion(node *nod, int start, int finish)
{
    auto temp = split3(nod, start, finish);
    get<1>(temp) -> rev ^= 1;
    return join3(get<0>(temp), get<1>(temp), get<2>(temp));
}

void dfs(node *nod)
{
    if(nod == &nil) return;
    reversion(nod);

    dfs(nod -> left);
    if(nod -> val > 0)
        fout << nod -> val << ' ';
    dfs(nod -> right);
}

node *root;
int n, useless;
char op;
int pos, val, start, finish;


int main()
{
    root = &nil;
    fin >> n >> useless;
    while(n--)
    {
        fin >> op;
        switch(op)
        {
        case 'I':
            fin >> pos >> val;
            root = insertion(root, pos - 1, val);
            break;
        case 'A':
            fin >> pos;
            fout << acces(root, pos - 1) -> val << '\n';
            break;
        case 'D':
            fin >> start >> finish;
            root = removal(root, start - 1, finish);
            break;
        case 'R':
            fin >> start >> finish;
            root = real_reversion(root, start - 1, finish);
            break;
        default:
            return cout << "ERROR", 0;

        }
    }
    dfs(root);

   return 0;
}