確認簡單圖
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%2d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int t;
int mz\[M\]\[M\];
int n,m;
struct ed{
int x,y,n;
ed(){n=0;};
}edges\[M\];
bool cmp(ed a,ed b){
if(a.x==b.x)return a.x<b.x;
return a.y<b.y;
}
void solve(){
for(int i=0;i<m;i++)edges\[i\].n=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(mz\[j\]\[i\]){
if(edges\[i\].n==0)edges\[i\].x=j;
else if(edges\[i\].n==1)edges\[i\].y=j;
edges\[i\].n++;
}
}
}
sort(edges,edges+m,cmp);
bool yes=true;
int x=-1,y=-1;
for(int i=0;i<m;i++){
if(x==edges\[i\].x&&y==edges\[i\].y){
yes=false;
break;
}
if(edges\[i\].n!=2){
yes=false;
break;
}
x=edges\[i\].x;
y=edges\[i\].y;
}
printf("%s\\n",yes?"Yes":"No");
}
int main(){
ios\_base::sync\_with\_stdio(0);
// freopen("input.txt","r",stdin);
scanf("%d",&t);
while(t--){
Set(mz,0);
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%d",&mz\[i\]\[j\]);
}
}
solve();
}
}