#include<iostream>
#include<algorithm>
using namespace std;
typedef long long int lli;
int main()
{
    lli t,n,k,a[100000],t1,p,q;
    cin>>t;
    while(t--)
    {
        lli count=0,r=0,k1=0;
        cin>>n>>k;
        k -= 1;
        for(lli i=0;i<n;i++) cin>>a[i];

        for(lli i=0;i<(n*(n/2));i++)
        {
            if(i%n==0 && i>=2*n)
              {
                k1 += n;count++;r++;
              }

            if(i>=n*r+n+n/2 && i<(2+r)*n )
              {
                  if(i<2*n)
                  {
                    a[i] = a[i%n] ^ a[n+n-1-i%n];
                  }
                  else
                  {
                       a[i] = a[k1+i%n] ^ a[k1*(count+r)+n-1-i%n];
                  }
              }
            else
            {
               a[i] = a[k1+i%n] ^ a[k1*count+n-1-i%n];
               //cout<<a[i]<<" ";
             }
        }
        cout<<k<<endl;
        if( k%n != 0 || k%n==0)
        {
            p = n*((k/n)%3);
            q = p+(k%n);

            // cout<<p<<" "<<q<<endl;
            for(lli i=p;i<=q;i++)
             {
                cout<<a[i]<<" ";
             }

             if(p<n)
            {
              for(lli i=0;i<n-1-(k%n);i++)
             {
                cout<<a[q+(2*n)+i+1]<<" ";
             }
            }
            else
             {
                for(lli i=0;i<n-1-(k%n);i++)
                 {
                   cout<<a[q-n+i+1]<<" ";
                 }
              }
        }
     }
}