#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<math.h>
using namespace std;

#define official

//#ifdef official
#define cin inF
#define cout outF                               //sdfgdsgdfsgfsdgsdfgsdfg
//#endif

ifstream inF("rotate.in");
ofstream outF("rotate.out");

const int MAX_N=1100;

int n,r,q;
int a[MAX_N][MAX_N];

struct num
{
    int v,p;
};
bool cmp(num a, num b)
{
    return a.v>b.v;
}

num ns[MAX_N+100];

void input1()
{
    cin>>n>>r;
}
void input2()
{
    cin>>q;
}
void output()
{
    int x,y;
    for (int i=0;i<q;++i)
    {
        cin>>x>>y;
        cout<<a[x][y]<<'\n';
    }
}
int curr[MAX_N];
void rot()
{
    char rt;
    int p,p2;
    int t;
    cin>>rt>>p;
    if (rt=='d' || rt=='x')
    {
        cin>>p2;
    }
    cin>>t;
    int x,y,num;
    if (rt=='r')
    {
        for (int i=0;i<n;++i)
        {
            curr[(i+t+2000*n)%n]=a[p][i];
        }
        for (int i=0;i<n;++i)
        {
            a[p][i]=curr[i];
        }
    }
    else if (rt=='c')
    {
        for (int i=0;i<n;++i)
        {
            curr[(i+t+2000*n)%n]=a[i][p];
        }
        for (int i=0;i<n;++i)
        {
            a[i][p]=curr[i];
        }
    }
    else if (rt=='d')
    {
        if (p<p2)
        {
            x=0;
            y=p2-p;
            num=n-y;
        }
        else
        {
            y=0;
            x=p-p2;
            num=n-x;
        }
        for (int i=0;i<num;++i)
        {
            curr[(i+t+2000*num)%num]=a[x+i][y+i];
        }
        for (int i=0;i<num;++i)
        {
            a[x+i][y+i]=curr[i];
        }
    }
    else if (rt=='x')
    {
        if (p<n-p2-1)
        {
            x=0;
            y=p+p2;
            num=y+1;
        }
        else
        {
            y=n-1;
            x=p+p2-n+1;
            num=n-x;
        }
        for (int i=0;i<num;++i)
        {
            curr[(i+t+2000*num)%num]=a[x+i][y-i];
        }
        for (int i=0;i<num;++i)
        {
            a[x+i][y-i]=curr[i];
        }
    }
    /*cerr<<rt<<" "<<p<<" "<<p2<<" "<<t<<endl;
    cerr<<endl;
    for (int i=0;i<n;++i)
    {
        for (int j=0;j<n;++j)
        {
            cerr<<a[i][j]<<" ";
        }
        cerr<<endl;
    }
    cerr<<endl;*/
}
void solve()
{
    for (int i=0;i<n;++i)
    {
        for (int j=0;j<n;++j)
        {
            a[i][j]=1+i*n+j;
        }
    }
    for (int i=0;i<r;++i)
    {
        rot();
    }
}

int main()
{
    input1();
    solve();
    input2();
    output();

    return 0;
}