Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 <= i, j <= N).

We can change the matrix in the following way. Given a rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2), we change all the elements in the rectangle by using "not" operation (if it is a '0' then change it into '1' otherwise change it into '0'). To maintain the information of the matrix, you are asked to write a program to receive and execute two kinds of instructions.

1. C x1 y1 x2 y2 (1 <= x1 <= x2 <= n, 1 <= y1 <= y2 <= n) changes the matrix by using the rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2). 
2. Q x y (1 <= x, y <= n) querys A[x, y]. 

The first line of the input is an integer X (X <= 10) representing the number of test cases. The following X blocks each represents a test case.

The first line of each block contains two numbers N and T (2 <= N <= 1000, 1 <= T <= 50000) representing the size of the matrix and the number of the instructions. The following T lines each represents an instruction having the format "Q x y" or "C x1 y1 x2 y2", which has been described above.

For each querying output one line, which has an integer representing A[x, y].

There is a blank line between every two continuous test cases.

1

2 10

C 2 1 2 2

Q 2 2

C 2 1 2 1

Q 1 1

C 1 1 2 1

C 1 2 1 2

C 1 1 2 2

Q 1 1

C 1 1 2 1

Q 2 1

1

0

0

1

#include<iostream>

#include<string.h>

#include<stdio.h>

using namespace std;

const int N=;

int c[N][N];

int q,n;

int lowbit(int x)

{

    return x&(-x);

}

int get_sum(int x,int y)

{

    int ans=;

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

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

        ans+=c[i][j];

    return ans;

}

void update(int x,int y,int data)

{

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

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

        c[i][j]+=data;

}

int main()

{

    int t;

    scanf("%d",&t);

    while(t--)

    {

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

        memset(c,,sizeof(c));

        char op[];

        int x1,y1,x2,y2;

        while(q--)

        {

            scanf("%s",op);

            if(op[]=='C')

            {

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

                update(x1,y1,);

                update(x2+,y1,);

                update(x1,y2+,);

                update(x2+,y2+,);

            }

            else

            {

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

                if(get_sum(x1,y1)%==) puts("");

                else puts("");

            }

        }

        if(t>) puts("");

    }

    return ;

}