1 program panel;
 2 var
 3    s:array[1..200,1..200] of integer;
 4    jin:array[1..200]of integer;
 5    num2,num3:array[1..200]of string;
 6    st1,st2:string;
 7    w:array[1..200] of longint;
 8    boo:array[1..200]of boolean;
 9    num:array[1..200] of longint;
10    i,j,k,l,h,m,n,q,t:longint;
11    bool,bool2:boolean;
12 begin
13         assign(input,'panel.in');
14         assign(output,'panel.out');
15         reset(input);
16         rewrite(output);
17         read(k);
18         for q:=1 to k do
19         begin
20         fillchar(s,sizeof(s),0);
21         fillchar(num,sizeof(num),0);
22         bool:=true;
23         read(n,m);
24         for i:=1 to 2*n do
25                 for j:=1 to m do
26                 begin
27                         read(s[i,j]);
28                         if s[i,j]=0 then inc(num[i]);
29                 end;
30         i:=1;
31         while((num[i]=num[i+n])or(num[i]+num[i+n]=m))and(i<=n)do
32         begin
33                 inc(i);
34                 if ((num[i]<>num[i+n])and(num[i]+num[i+n]<>m))and(i<=n)
35                 then bool:=false;
36         end;
37         if not bool then writeln('NO')
38         else
39                 begin
40                 h:=0;
41                 for i:=1 to n do
42                         if num[i]=m div 2 then begin inc(h); w[h]:=i; end;
43                 for i:=1 to n do
44                         begin
45                         if (num[i]<>num[i+n])and(num[i]+num[i+n]=m) then
46                                 begin
47                                 for j:=1 to m do
48                                         if s[i,j]=0 then s[i,j]:=1
49                                                 else s[i,j]:=0;
50                                 end;
51                         end;
52                 bool2:=true;
53                 for i:=1 to m do
54                         delete(num2[i],1,length(num2[i]));
55                 for i:=1 to m do
56                         delete(num3[i],1,length(num3[i]));
57                 for j:=1 to m do
58                         for i:=1 to n do
59                                 num2[j]:=num2[j]+chr(s[i,j]+48);
60                 for j:=1 to m do
61                         for i:=n+1 to 2*n do
62                                 num3[j]:=num3[j]+chr(s[i,j]+48);
63                 j:=0;
64                 fillchar(boo,sizeof(boo),true);
65                 bool2:=true;
66                 repeat
67                         inc(j);
68                         t:=0;
69                         repeat
70                         inc(t);
71                         if (num2[j]=num3[t])and(boo[t])then boo[t]:=false;
72                         until((num2[j]=num3[t]))or(t>=m);
73                         if (num2[j]<>num3[t])and(j<=m)
74                         then bool2:=false;
75                 until (num2[j]<>num3[t]) or (j>=m);
76                 if not bool2 then
77                                 begin
78                                 inc(jin[1]);
79                                 e:=1;
80                                 while jin[e]=2 do begin jin[e]:=0; inc(e); inc(jin[e]) end;
81                                 if w[h+1]=1 then write('NO')
82                                 else begin
83                                         for i:=1 to h do
84                                                 if w[h]=1 then
85                                                                 begin{到这里就变得很复杂了！}
86                                         end;
87                                 end;
88                 else writeln('YES');
89                 end;
90                 end;
91         close(input);
92         close(output);
93 end.