#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int tree[1005][1005]={0},n;
int offline()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    return 0;
}
int exit()
{
    fclose(stdin);
    fclose(stdout);
    return 0;
}
int lowbit(int t) 
{  
    return t&(-t); 
} 
int sum(int x,int y) 
{  
    int ans=0;  
    for(int i=x;i>0;i-=lowbit(i))   
        for(int j=y;j>0;j-=lowbit(j))   
            ans+=tree[i][j];
    return ans; 
} 
void plus(int x,int y,int num) 
{  
    for(int i=x;i<=n;i+=lowbit(i))   
        for(int j=y;j<=n;j+=lowbit(j))
            tree[i][j]+=num;
}
int main() 
{
    offline();
    int cnt,t,a,b,x1,x2,y1,y2;
    char order;
    scanf("%d",&cnt);
    while(cnt--)
    {
        memset(tree,0,sizeof(tree));
        scanf("%d %d",&n,&t);
        getchar();
        while(t--)
        {
            scanf("%c",&order);
            if(order=='C')
            {
                scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
                getchar();
                plus(x1,y1,1);
                plus(x1,y2+1,1);
                plus(x2+1,y1,1);
                plus(x2+1,y2+1,1);
            }
            else
            {
                scanf("%d %d",&a,&b);
                getchar();
                printf("%d\n",sum(a,b)%2);
            }   
        }
        printf("\n");
    }
    exit();
    return 0;
}