#include <set>

#include <map>

#include <cmath>

#include <queue>

#include <vector>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int MAXN=;

int t[MAXN][MAXN],n;

int lb(int i){return i&-i;}

void init(){memset(t,,sizeof(t));}

void add(int x,int y,int v){

    for(int i=x;i<=n;i+=lb(i))for(int j=y;j<=n;j+=lb(j))t[i][j]+=v;

}

int sum(int x,int y){

    int ans=;for(int i=x;i;i-=lb(i))for(int j=y;j;j-=lb(j))ans+=t[i][j];return ans;

}

int a,b,c,d,x,T;char s[];

void C(){cin>>a>>b>>c>>d;add(a,b,),add(c+,b,),add(a,d+,),add(c+,d+,);}

void Q(){cin>>a>>b;cout<<sum(a,b)%<<endl;}

int main(){

    for(scanf("%d",&x);x--;x?puts(""):){

        scanf("%d%d",&n,&T),init();

        while(T--)scanf("%s",s),s[]=='C'?C():Q();

    }
　　 return 0；

}