#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
#define wln putchar('\n')
template<class T1,class T2> void chkmax(T1 &x,T2 y){if(y>x)x=y;}
template<class T1,class T2> void chkmin(T1 &x,T2 y){if(y<x)x=y;}
const int N=300005;
int n,m;
int a[N],b[N],ib[N],ia[N];
char opt[10];
struct szsz
{
    int v[N];
    void init(){fill(v+1,v+n+1,0);}
    void modify(int x,int y)
    {
        for(int i=x;i<=n;i+=i&-i)v[i]+=y;
    }
    int query(int x)
    {
        int res=0;
        for(int i=x;i;i-=i&-i)res+=v[i];
        return res;
    }
}T1,T2;
void Main()
{
    scanf("%d%d",&n,&m);
    For(i,1,n)
    {
        scanf("%d%d",a+i,b+i);
        ia[a[i]]=i;
        ib[b[i]]=i;
    }
    T1.init(); T2.init();
    int da=0,db=0,la=1,ra=n,lb=1,rb=n;
    T1.modify(b[ia[a[1]]],1);
    T2.modify(b[ia[a[n]]],1);
    For(i,1,m)
    {
        scanf("%s",opt);
        if(opt[0]=='U')
        {
            int x;
            scanf("%d",&x);
            if(la>=ra){da=max(1,da-x); continue;}
            da-=x;
            while(la<ra&&la+da<=0)T1.modify(b[ia[a[++la]]],1);
            if(la>=ra)la=n,ra=1,da=1;
        }
        else if(opt[0]=='D')
        {
            int x;
            scanf("%d",&x);
            if(la>=ra){da=min(n,da+x); continue;}
            da+=x;
            while(la<ra&&ra+da>n)T1.modify(b[ia[a[--ra]]],1);
            if(la>=ra)la=n,ra=1,da=n;
        }
        else if(opt[0]=='L')
        {
            int x;
            scanf("%d",&x);
            if(lb>=rb){db=max(1,db-x); continue;}
            db-=x;
            while(lb<rb&&lb+db<=0)lb++;
            if(lb>=rb)lb=n,rb=1,db=1;
        }
        else if(opt[0]=='R')
        {
            int x;
            scanf("%d",&x);
            if(lb>=rb){db=min(n,db+x); continue;}
            db+=x;
            while(lb<rb&&rb+db>n)rb--;
            if(lb>=rb)lb=n,rb=1,db=n;
        }
        else if(opt[0]=='?')
        {
            int x;
            scanf("%d",&x);
            int ax=0,bx=0;
            if(la>=ra)ax=da;
            else if(a[x]<=la)ax=la+da;
            else if(a[x]>=ra)ax=ra+da;
            else ax=a[x]+da;
            if(lb>=rb)bx=db;
            else if(b[x]<=lb)bx=lb+db;
            else if(b[x]>=rb)bx=rb+db;
            else bx=b[x]+db;
            printf("%d %d\n",ax,bx);
        }
        else
        {
            ll ans=0;
            if(la>=ra)
            {
                if(lb>=rb)ans=1ll*n*(n-1)/2;
                else ans=1ll*lb*(lb-1)/2+1ll*(n-rb+1)*(n-rb)/2;
            }
            else
            {
                if(lb>=rb)ans=1ll*la*(la-1)/2+1ll*(n-ra+1)*(n-ra)/2;
                else
                {
                    int cnt1=T1.query(lb),cnt2=la-T1.query(rb-1),cnt3=T2.query(lb),cnt4=n-ra+1-T2.query(rb-1);
                    ans+=1ll*cnt1*(cnt1-1)/2;
                    ans+=1ll*cnt2*(cnt2-1)/2;
                    ans+=1ll*cnt3*(cnt3-1)/2;
                    ans+=1ll*cnt4*(cnt4-1)/2;
                }
            }
            printf("%lld\n",ans);
        }
        // printf("a:[%d|%d|%d]\n",la,da,ra);
        // printf("b:[%d|%d|%d]\n",lb,db,rb);
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)Main();
}
/*
1
4 9
3 4
2 1
4 2
1 3
L 2
? 1
? 2
R 1
? 1
? 3
!
U 3
!
*/