#include <iostream>

#include <cstdio>

#include <cstring>

#include <map>

#include <algorithm>

using namespace std;

int n,c[][];

int lowbit(int k)

{

    return k&(-k);

}

void add(int x,int y,int num)

{

    for(int i = x; i <= n; i += lowbit(i))

        for(int j = y; j <= n; j += lowbit(j))

            c[i][j] += num;

}

int cal(int x,int y)

{

    int sum = ;

    for(int i = x; i >= ; i -= lowbit(i))

        for(int j = y; j >= ; j -= lowbit(j))

            sum += c[i][j];

    return sum;

}

int  main()

{

    int x;

    scanf("%d",&x);

    while(x--)

    {

        int t;

        memset(c,,sizeof(c));

        scanf("%d%d",&n,&t);

        char op;

        while(t--)

        {

            cin>>op;

            if(op == 'C')

            {

                int x1,y1,x2,y2;

                scanf("%d %d %d %d",&x1,&y1,&x2,&y2);

                x1++,x2++,y1++,y2++;

                add(x2,y2,);

                add(x1-,y1-,);

                add(x1-,y2,);

                add(x2,y1-,);

            }

            else

            {

                int x,y;

                scanf("%d%d",&x,&y);

                //++x,++y

                int ans = cal(x,y);// - cal(x-1,y-1) - cal(x-1,y) - cal(x,y-1);

                ans %= ;

                printf("%d\n",ans);

            }

        }

        puts("");

    }

    return ;

}