#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <numeric>
#include <sstream>
#include <cmath>
#include <set>
#include <stack>
#include <iomanip>
#include <limits.h>
#include <queue>
#include <fstream>
#include <unordered_set>
#include <unordered_map>
#include <exception>
#include <deque>
#include <string>

using namespace std;
fstream in_file;
fstream out_file;

int main()
{
    in_file.open("secv8.in");
    out_file.open("secv8.out", ios::out);

    vector<int> sir;
    int n = 0;

    int nr_op, reverse;
    in_file >> nr_op >> reverse;
    

    char operatie;
    int operand1, operand2;

    while (nr_op--)
    {
        in_file >> operatie;
        if (operatie == 'I')
        {
            in_file >> operand1>>operand2;
            if (operand1 == (n + 1))
            {
                sir.push_back(operand2);
            }
            else
            {
                sir.insert(sir.begin() + operand1 - 1, operand2);
            }
            n++;
        }
        else if (operatie == 'A')
        {
            in_file >> operand1;
            out_file << sir[operand1-1] <<"\n";
        }
        else if (operatie == 'R')
        {
            in_file >> operand1 >> operand2;
            std::reverse(sir.begin() + operand1 - 1, sir.begin() + operand2 );
        }
        else if (operatie == 'D')
        {
            in_file >> operand1 >> operand2;
            sir.erase(sir.begin() + operand1 - 1, sir.begin() + operand2);
            n = n - (operand2 - operand1 + 1);
        }
        
    }
    
    for (int i = 0; i < n; i++)
        out_file << sir[i] << " ";
    

    in_file.close();
    out_file.close();
}