#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=1510;
const int M=50010;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
int mx;
char s[3];
ll B,t[55],f[2][2][N][N];
ll getans(int x,int y) {
int one=x&1,two=y&1;ll ret=0;
int i,j,X=x/2+one,Y=y/2+two;
for (i=X;i;i-=i&-i)
for (j=Y;j;j-=j&-j) ret^=f[one][two][i][j];
return ret;
}
void add(int x,int y) {
int one=x&1,two=y&1;
int i,j,X=x/2+one,Y=y/2+two;
for (i=X;i<=mx;i+=i&-i)
for (j=Y;j<=mx;j+=j&-j) f[one][two][i][j]^=B;
}
int main()
{
int i,j,k,n,m,x,y,x1,y1,x2,y2;
for (i=0;i<=50;i++) t[i]=1ll<<i;
while (scanf("%d%d", &n, &m)!=EOF) {
memset(f,0,sizeof(f));mx=n/2+1;
for (i=1;i<=m;i++) {
scanf("%s%d%d%d%d", s, &x1, &y1, &x2, &y2);
if (s[0]=='Q') {
x1--;y1--;
B=getans(x1,y1)^getans(x2,y2)^getans(x1,y2)^getans(x2,y1);
for (j=1;j<=50;j++)
if (B&t[j]) printf("2 ");
else printf("1 ");
printf("\n");
} else {
scanf("%d", &k);B=0;
for (j=1;j<=k;j++) {
scanf("%d%d", &x, &y);
if (y&1) B^=t[x];
}
x2++;y2++;
add(x1,y1);add(x2,y2);
add(x1,y2);add(x2,y1);
}
}
}
return 0;
}