#include<bits/stdc++.h>
using namespace std;
namespace file_read{
	char ib[1<<24],*ip1=ib,*ip2=ib;
	inline char gc(){
		return ((ip1==ip2)&&(ip2=(ip1=ib)+fread(ib,1,1<<24,stdin)),ip1==ip2?EOF:*ip1++);
	}
	inline int read(){
		int x=0;char c=gc();
		while(c<'0'||c>'9')c=gc();
		while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^'0'),c=gc();
		return x;
	}
	inline long long readl(){
		long long x=0;char c=gc();
		while(c<'0'||c>'9')c=gc();
		while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^'0'),c=gc();
		return x;
	}
}
using namespace file_read;
long long a[100005];
int n,m;
long long ann;
namespace yuchu{
	int b[100005];
	void solve(){
		for(int i=1;i<=n;++i)b[i]=a[i];
		sort(b+1,b+n+1);
		long long ans=0;
		for(int t=59;t>=0;--t){
			int w=lower_bound(b+1,b+n+1,1ll<<t)-b;
			if((n-w+1)%2==0){
				for(int i=w;i<=n;++i)b[i]^=1ll<<t;
				inplace_merge(b+1,b+w,b+n+1);
				continue;
			}
			if(w>1){
				ans+=(1ll<<t)-b[w-1];
				b[w-1]=1ll<<t;
				for(int i=w-1;i<=n;++i)b[i]^=1ll<<t;
				inplace_merge(b+1,b+w-1,b+n+1);
				continue;
			}
		}
		ann=ans;
		printf("%lld\n",ans);
	}
}
long long aj[100005];
int p2[100005];
namespace baoli{
	pair<long long,int>pi[100005];
	int tt;vector<pair<int,int>>vv[100005];
	int hh[35],aa[35][100005],pp[35][100005];
	int tj[100005],st[105],sl=0;
	bool dfs(int t,long long he){
		if(t<0){
			if(he>ann)return 0;
			--m;
			vector<pair<int,int>>vc;
			for(int i=1;i<=n;++i)if(aj[i])vc.emplace_back(i,aj[i]);
			vv[++tt]=vc;
			return 1;
		}
		int gs=hh[t];
		for(int i=1;i<=sl;++i){
			int j=st[i];
			gs-=aa[t][j]>>t&1;
		}
		if(gs%2==0){
			return dfs(t-1,he);
		}
		int fl=0,cg=1;
		for(int i=n-gs;i>=1&&cg&&m;--i){
			int j=pp[t][i];
			if(tj[j])continue;
			if((aa[t][j]>>t&1))continue;
			long long sb=(1ll<<t)-aa[t][j];
			aj[j]+=sb;++tj[j];
			if(tj[j]==1)st[++sl]=j;
			int ff=1;
			if(dfs(t-1,he+sb))fl=1;
			else ff=0;
			if(tj[j]==1)--sl;
			--tj[j];aj[j]-=sb;
			if(!ff)return fl;
		}
		for(int i=1;i<=sl&&cg&&m;++i){
			int j=st[i];
			long long sb=(1ll<<t)-0;
			aj[j]+=sb;++tj[j];
			if(tj[j]==1)st[++sl]=j;
			int ff=1;
			if(dfs(t-1,he+sb))fl=1;
			else ff=0;
			if(tj[j]==1)--sl;
			--tj[j];aj[j]-=sb;
			if(!ff)return fl;
		}
		return fl;
	}
	void solve(){
		for(int i=1;i<=n;++i)p2[i]=i;
		sort(p2+1,p2+n+1,[&](int x,int y){
			return a[x]<a[y];
		});
		for(int t=29;t>=0;--t){
			hh[t]=0;
			int w=0;
			for(int i=1;i<=n;++i){
				aa[t][i]=a[i]&((1<<(t+1))-1);
				pp[t][i]=p2[i];hh[t]+=(aa[t][i]>>t&1);
			}
			for(int i=1;i<=n;++i){
				if(aa[t][p2[i]]<(1<<t))w=i;
			}
			inplace_merge(p2+1,p2+w+1,p2+n+1,[&](int x,int y){
				return (a[x]&((1<<t)-1))<(a[y]&((1<<t)-1));
			});
		}
		for(int i=1;i<=n;++i)aj[i]=0;
		tt=0;dfs(29,0);
		printf("%d\n",tt);
		for(int i=1;i<=tt;++i){
			vector<pair<int,int>>vc=vv[i];
			int z=vc.size();
			printf("%d\n",z);
			for(int j=0;j<z;++j)printf("%d ",vc[j].first);
			printf("\n");
			for(int j=0;j<z;++j)printf("%d ",vc[j].second);
			printf("\n");
		}
	}
}
int main(){
	int c=read(),T=read();
	assert(c>=0);
	while(T--){
		n=read(),m=read();
		for(int i=1;i<=n;++i)a[i]=readl();
		if(c<=7||(14<=c&&c<=21)){
			yuchu::solve();
			baoli::solve();
			continue;
		}
		long long ans=0;
		for(int i=1;i<=n;++i)aj[i]=0;
		for(int t=59;t>=0;--t){
			int gs=0;
			for(int i=1;i<=n;++i)if(a[i]>>t&1)++gs;
			if(gs%2==0)continue;
			if(gs<n)break;
			for(int tt=t;tt<=59;++tt){
				int gs=0;
				for(int i=1;i<=n;++i)if(a[i]>>tt&1)++gs;
				if(gs<n)break;
				long long T=(1ll<<(tt+1))-1;
				long long mx=-1;int wz=0;
				for(int i=1;i<=n;++i){
					if(mx<a[i])mx=a[i],wz=i;
				}
				mx=a[wz]&T;++T;
				ans+=T-mx;aj[wz]+=T-mx;a[wz]+=T-mx;
			}
		}
		for(int t=60;t>=0;--t){
			int gs=0;
			for(int i=1;i<=n;++i)if(a[i]>>t&1)++gs;
			if(gs%2==0)continue;
			long long T=(1ll<<(t+1))-1;
			long long mx=-1;int wz=0;
			for(int i=1;i<=n;++i){
				if((a[i]&T)>=(1ll<<t))continue;
				if(mx<(a[i]&T))mx=(a[i]&T),wz=i;
			}
			ans+=(1ll<<t)-mx;aj[wz]+=(1ll<<t)-mx;a[wz]+=(1ll<<t)-mx;
		}
		printf("%lld\n",ans);
		printf("%d\n",1);
		int gs=0;
		for(int i=1;i<=n;++i)if(aj[i])++gs;
		printf("%d\n",gs);
		for(int i=1;i<=n;++i)if(aj[i])printf("%d ",i);
		printf("\n");
		for(int i=1;i<=n;++i)if(aj[i])printf("%lld ",aj[i]);
		printf("\n");
	}
	return 0;
}