#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <list>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <stack>

#include <limits.h>

using namespace std;

int i,j,k,T,TC,cnt;

int a[],f[],pos[];

int main()

{

        scanf("%d",&T);

        while (T--)

        {

                memset(f,true,sizeof(f));

                cnt = ;

                memset(a,,sizeof(a));

                for (i = ; i <= ; i++) scanf("%d",&a[i]);

                for (i = ; i <= ; i++)

                {

                        for (j = ; j <= ; j++)

                        {

                                if (i != ) a[(i-)*+j] |=  << ((i - ) *  + j);

                                if (i != ) a[(i-)*+j] |=   << (i *  + j);

                                if (j != ) a[(i-)*+j] |=  << ((i - ) *  + j - );

                                if (j != ) a[(i-)*+j] |=  << ((i - ) *  + j + );

                                a[(i-)*+j] |=  << ((i - ) *  + j);

                        }

                }

                for (i = ; i <= ; i++)

                {

                        for (j = i + ; j <= ; j++)

                        {

                                if (a[j] > a[i])

                                        swap(a[i],a[j]);

                        }

                        if (a[i] == ) break;

                        for (k = ; k; k--)

                        {

                                if (a[i] & ( << k))

                                {

                                        for (j = ; j <= ; j++)

                                        {

                                                if (i != j && (a[j] & ( << k)))

                                                        a[j] ^= a[i];

                                        }

                                        f[k] = false;

                                        pos[k] = i;

                                        break;

                                }

                        }

                }

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

                for (i = ; i <= ; i++)

                {

                        if (f[i]) printf("0 ");

                        else printf("%d ",a[pos[i]]&);

                        if (i %  == ) printf("\n");

                }

        }    

        return ;

}