#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lll __int128
#define db double
#define ld long double
#define eps 1e-8
#define fir first
#define sec second
#define pb push_back
using namespace std;
void rd(){}
template<typename T,typename... U> void rd(T &x,U&... arg){
    x=0;int f=1,c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') x=x*10+c-48,c=getchar();
    x*=f;rd(arg...);
}
template<typename T> void wr(T n,char end=0){
	if(n<0) putchar('-'),n=-n;
	if(n==0) putchar('0');
	static int a[50];int p=0;
	while(n!=0){a[++p]=(int)(n%10);n/=10;}
	while(p) putchar(a[p--]+48);
	if(end) putchar(end);
}
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
template<typename T> inline bool chkmax(T &x,T y){return x<y&&(x=y,1);}
const int maxn=2e5+5;
const ll inf=0x3f3f3f3f3f3f3f3f;
int testid,N,M,__M,V;
ll a[maxn],b[maxn],K,s,k;
typedef map<int,ll> info;
info mp;
vector<info> ans;
pli arr[62][maxn];//对第i位按照后i-1位大小排序
int n[62];//第i位为0的数量
vector<int> vec;//当前低位全都是0的下标集合
inline void upd(int i,int p,ll nxt){
	nxt=~nxt?nxt:((b[i]>>p<<p)+(1LL<<p));
	if((mp[i]=nxt)==a[i]) vec.pop_back(),mp.erase(i);
	if(b[i]==a[i]) vec.pb(i);
	s^=b[i]^nxt,k+=nxt-b[i],b[i]=nxt;
}
bool dfs(int p){
    if(k>K||__M>=M) return 0;
    if(p==-1) return ans.pb(mp),__M++,1;
    if(!((s>>p)&1)) return dfs(p-1);
    bool flag=0,f=1;
    for(int i=1;i<=n[p]&&f;i++){
    	int x=arr[p][i].sec;
    	if(b[x]!=a[x]) continue;
    	upd(x,p,-1);
    	f=dfs(p-1);
    	flag|=f;
    	upd(x,p,a[x]);
	}
	if(f){
		int siz=(int)vec.size();
		for(int i=0;i<siz&&f;i++){
			int x=vec[i];
			ll t=b[x];
			upd(x,p,-1);
			f=dfs(p-1);
			flag|=f; 
			upd(x,p,t);
		}
	}
    return flag&&__M<M;
}
void __main(){
	V=0;
    rd(N,M);
    for(int i=1;i<=N;i++) rd(a[i]);
    for(int i=1;i<=N;i++)
    	for(int j=0;j<=60;j++)
    		if((1LL<<j)>a[i]){
    			V=max(V,j);
    			break;
			}
    int pos=-1;
    auto check=[&](int p){
        ll s=0,k=0;
        for(int i=1;i<=N;i++) b[i]=a[i],s^=b[i];
        if(~p){
            ll Max1=-1,Max2=-1;
            int id1=0,id2=0;
            for(int i=1;i<=N;i++)
                if(!((b[i]>>p)&1)){
                    ll t=b[i]&((1LL<<p)-1);
                    if(t>Max1) Max2=Max1,id2=id1,Max1=t,id1=i;
                    else if(t>Max2) Max2=t,id2=i;
                }
            if(!id2) return inf;
            k=(1LL<<(p+1))-Max1-Max2;
            s^=b[id1]^b[id2];
            b[id1]=(b[id1]>>p<<p)+(1LL<<p);
            b[id2]=(b[id2]>>p<<p)+(1LL<<p);
            s^=b[id1]^b[id2];
        }
        for(int i=V;~i;i--){
            if((s>>i)&1){
                ll Max=-1;
                int id=0;
                for(int j=1;j<=N;j++)
                    if(!((b[j]>>i)&1)&&chkmax(Max,b[j]&((1LL<<i)-1)))
                        id=j;
                if(!id) return pos=i,inf;
                k+=(1LL<<i)-Max;
                s^=b[id];
                b[id]=(b[id]>>i<<i)+(1LL<<i);
                s^=b[id];
            }
        }
        return k;
    };
    K=check(-1);
    vector<int> vec;
    if(~pos){
        for(int i=V;i>pos;i--){
            ll t=check(i);
            if(K>t) K=t,vec.clear();
            if(K==t) vec.pb(i);
        }
    }else vec.pb(-1);
    __M=0,s=k=0;
    ans.clear();
    for(int i=1;i<=N;i++) b[i]=a[i],s^=b[i];
    for(int i=V;~i;i--){
    	n[i]=0;
        for(int j=1;j<=N;j++)
            if(!((a[j]>>i)&1))
                arr[i][++n[i]]={(a[j]&((1LL<<i)-1)),j};
        sort(arr[i]+1,arr[i]+n[i]+1,[](pil i,pil j){return i.fir>j.fir;});
    }
    cout<<"N = "<<N<<", M = "<<M<<", pos = "<<pos<<"\n";
    for(int p:vec){
        if(__M>=M) break;
        if(p==-1){dfs(V);break;}
        for(int i=2;i<=n[p]&&__M<M;i++){
            bool flag=0;
            for(int j=1;j<i&&__M<M;j++){
            	int xi=arr[p][i].sec,xj=arr[p][j].sec;
                upd(xi,p,-1);
                upd(xj,p,-1);
                bool f=dfs(p-1);
                flag|=f;
                upd(xi,p,a[xi]);
                upd(xj,p,a[xj]);
                if(!f) break;
            }
            if(!flag) break;
        }
    }
    wr(K,'\n'),wr(__M,'\n'); 
    for(info mp:ans){
    	wr(mp.size(),'\n');
        for(auto i:mp) wr(i.fir,' ');
        putchar('\n');
        for(auto i:mp) wr(i.sec-a[i.fir],' ');
        putchar('\n');
    }
}
int main(){
//     freopen("2.in","r",stdin);
    // freopen("nim.in","r",stdin);
//     freopen("nim.out","w",stdout);
    int T;rd(testid,T);
    while(T--) __main();
    return 0;
}
//g++ -std=c++14 -O2 -Wall -Wextra -Wconversion nim.cpp -o nim