/*
*Rainto96
*Beijing University of Posts and Telecommunications School of Software Engineering
*http://blog.csdn.net/u011775691
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <climits>
using namespace std;
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define VINT vector<int>
#define PII pair<int,int>
#define MP(x,y) make_pair((x),(y))
#define ll long long
#define ull unsigned ll
#define MEM0(x)  memset(x,0,sizeof(x))
#define MEM(x,val) memset((x),val,sizeof(x))
#define scan(x) scanf("%d",&(x))
#define scan2(x,y) scanf("%d%d",&(x),&(y))
#define scan3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z))
#define scan4(x,y,z,k) scanf("%d%d%d%d",&(x),&(y),&(z),&(k))
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
using namespace std;
#define Lowbit(x) ((x)&(-x))
int c[555][555];
int n,m,q;
void add(int x, int y,int delta){//不能传入0
    int i=y;
    while(x<=n){
        y=i;
        while(y<=m){
            c[x][y]^=delta;
            y+=Lowbit(y);
        }
        x+=Lowbit(x);
    }
}
int Sum(int x, int y){//可以传入0
        //cerr<<"--------"<<endl;
    int i=y, sum=0;
    while(x>0){
        y=i;
        while(y>0){
            sum^=c[x][y];
            //cerr<<"sum:"<<sum<<" c:"<<c[x][y]<<endl;
            y-=Lowbit(y);
        }
        x-=Lowbit(x);
    }
    return sum;
}
void sets(int x,int y,int num){
        int num1=Sum(x,y) , num2= Sum(x-1,y) , num3=Sum(x,y-1) ,num4=Sum(x-1,y-1);
        int res = num1^num2^num3^num4;
        add(x,y,num^res);
}
int look(int x,int y){
        int num1=Sum(x,y) , num2= Sum(x-1,y) , num3=Sum(x,y-1) ,num4=Sum(x-1,y-1);
        int res = num1^num2^num3^num4;
        return res;
}
void show(){
        for(int i=1;i<=n;i++){
                for(int j=1;j<=m;j++){
                        cerr<<look(i,j)<<" ";
                }
                cerr<<endl;
        }
        cerr<<endl;
}
int main(){
    #ifndef ONLINE_JUDGE
        //freopen("C:/OJ/in.txt","r",stdin);
    #endif
    int T;
    scan(T);
    while(T--){
                MEM0(c);
                scan3(n,m,q);
                for(int i=1;i<=n;i++){
                        for(int j=1;j<=m;j++){
                                int val;scan(val);
                                add(i,j,val);
                        }
                }
                //cerr<<"show:"<<endl;
                //show();
                //cerr<<"show end"<<endl;

                while(q--){
                        int op;scan(op);
                        if(op==1){
                                int x1,y1,x2,y2;scan4(x1,y1,x2,y2);
                                int nx1=min(x1,x2) , nx2=max(x1,x2);
                                int ny1=min(y1,y2) , ny2=max(y1,y2);
                                int res = Sum(nx2,ny2) ^ Sum(nx2,ny1-1) ^ Sum(nx1-1,ny2) ^ Sum(nx1-1,ny1-1);
                                //cerr<< Sum(nx2,ny2)<<endl;
                                //cerr<< Sum(nx2,ny1-1)<<endl;
                                //cerr<<Sum(nx1-1,ny2)  <<endl;
                                //cerr<< Sum(nx1-1,ny1-1)<<endl;
                                //cerr<<endl;
                                if(res) puts("Yes");
                                else puts("No");
                        }else{
                                int x,y,val;scan3(x,y,val);
                                sets(x,y,val);
                                //show();
                        }
                }

    }
        return 0;
}