#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 const int N=;

 int a[N][N],ans[N];

 int dx[]={,,,-,};

 int dy[]={,,,,-};

 int idx(int x,int y){return (x-)*+y;}

 void gauss(int nn){

     int i,j,k,l;

     for(i=,j=;i<=nn&&j<=nn;j++){

         for(k=i;k<=nn;k++)if(a[k][j])break;

         if(a[k][j]){

             for(l=;l<=nn+;l++) swap(a[i][l],a[k][l]);

             for(l=;l<=nn;l++){

                 if(l!=i&&a[l][j])

                     for(k=;k<=nn+;k++)

                         a[l][k]^=a[i][k];

             }

             i++;

         }

     }

     for(j=;j<i;j++) ans[j]=a[j][nn+];

 }

 int main(){

     int T,n=,m=,nn=n*m;

     scanf("%d",&T);

     for(int ca=;ca<=T;ca++){

         memset(a,,sizeof a);

         for(int i=;i<=n;i++)for(int j=;j<=m;j++)scanf("%d",&a[idx(i,j)][nn+]);

         for(int i=;i<=n;i++)for(int j=;j<=m;j++)for(int k=;k<=;k++){

             int x=i+dx[k],y=j+dy[k];

             if(x>n||y>m||x<||y<) continue;

             a[idx(i,j)][idx(x,y)]=;

         }

         gauss(nn);

         printf("PUZZLE #%d\n",ca);

         for(int i=;i<=;i++)printf("%d%c",ans[i],i%==?'\n':' ');

     }

     return ;

 }