#include <bits/stdc++.h>

using uint = unsigned;
using ullt = unsigned long long;
using Pair = std::pair<ullt,uint>;

std::vector<ullt>A; uint n,t,T[61];
std::vector<uint>P[61];uint At[61];

struct state{std::vector<Pair>Q;uint d,p;bool o,ok,y;};

ullt GetValue(state S)
{
    static bool Tmp[1000005];
    ullt w=0;for(auto p:S.Q)Tmp[p.second]=1,w^=A[p.second];
    if(~S.d)
    {
        while(S.o||(!S.ok&&S.d==T[S.d])||!S.y)
        {
            if(S.p<n)
            {
                if(Tmp[P[S.d][S.p]]){S.p++;continue;}
                Tmp[P[S.d][S.p]]=1,w^=A[P[S.d][S.p]],S.Q.push_back({(A[P[S.d][S.p]]>>S.d|1)<<S.d,P[S.d][S.p]}),S.o^=1,S.p++,S.ok=1,S.y=1;
            }
            else if(S.p<n+S.Q.size()&&!(S.Q[S.p-n].first>>S.d&1))S.Q[S.p-n].first|=1llu<<S.d,S.o^=1,S.p++,S.ok=1,S.y=1;
            else
            {
                for(auto p:S.Q)Tmp[p.second]=0;
                return-1llu;
            }
        }
        S.d--;
    }
    while(~S.d)
    {
        S.o=((S.p=At[S.d])&1)^((w>>S.d)&1);
        while(S.o||(!S.ok&&S.d==T[S.d]))
        {
            if(S.p<n)
            {
                if(Tmp[P[S.d][S.p]]){S.p++;continue;}
                Tmp[P[S.d][S.p]]=1,w^=A[P[S.d][S.p]],S.Q.push_back({(A[P[S.d][S.p]]>>S.d|1)<<S.d,P[S.d][S.p]}),S.o^=1,S.p++,S.ok=1;
            }
            else if(S.p<n+S.Q.size()&&!(S.Q[S.p-n].first>>S.d&1))S.Q[S.p-n].first|=1llu<<S.d,S.o^=1,S.p++,S.ok=1;
            else
            {
                for(auto p:S.Q)Tmp[p.second]=0;
                return-1llu;
            }
        }
        S.d--;
    }
    ullt ans=0;
    for(auto p:S.Q)ans+=p.first-A[p.second],Tmp[p.second]=0;
    return ans;
}

void solve()
{
    uint m;scanf("%u%u",&n,&m);A.resize(n);
    ullt x=0,y=-1;for(auto&a:A)scanf("%llu",&a),x^=a,y&=a;
    std::vector<state>S;
    std::vector<uint>Q;
    {
        std::vector<uint>&Q=P[60];Q.resize(n);for(uint j=0;j<n;j++)Q[j]=j;
        std::sort(Q.begin(),Q.end(),[&](uint a,uint b){return A[a]>A[b];});
        At[60]=0;while(At[60]<n&&((A[P[60][At[60]]]>>60)&1))At[60]++;
    }
    for(uint d=59;~d;d--)
    {
        P[d].resize(n);
        std::merge(P[d+1].begin(),P[d+1].begin()+At[d+1],P[d+1].begin()+At[d+1],P[d+1].end(),
                    P[d].begin(),[&](uint a,uint b){return(A[a]&((1llu<<(d+1))-1))>(A[b]&((1llu<<(d+1))-1));});
        At[d]=0;while(At[d]<n&&((A[P[d][At[d]]]>>d)&1))At[d]++;
    }
    t=60;while(~t&&!(x>>t&1))t--;
    ullt w=-1llu;uint t0=-1;
    if(~t&&(y>>t&1))
    {
        S={state{{},60,0,0,0,1}};
        while(At[t]>=n-1)t++;
        for(uint j=t;j<=60;j++)T[j]=-1u;
        for(uint j=t;j<=60;j++)if(At[j]<n-1)
        {
            T[j]=j;ullt g=GetValue(S[0]);
            if(g<w)w=g,t0=j;else if(w!=g)T[j]=-1;
        }
    }
    else S={state{{},60,0,0,1,1}},t=-1,w=GetValue(S[0]);
    Q.push_back(0);
    printf("%llu\n",w);
    std::vector<std::vector<Pair> >Ans;
    while(Q.size()&&m)
    {
        static bool Tmp[1000005];
        uint id=Q.back();Q.pop_back();
        auto s=S[id].Q;
        for(auto p:s)Tmp[p.second]=1;
        if(!S[id].o&&(S[id].ok||S[id].d!=t)&&S[id].y)
        {
            if(S[id].d)
            {
                Q.push_back(S.size()),S.push_back(S[id]);
                S.back().d--,S.back().o=(S.back().p=At[S.back().d])&1;
                for(auto p:s)if(A[p.second]>>S.back().d&1)S.back().o^=1;
                if(!S[id].ok&&S[id].d==t0)S.pop_back(),Q.pop_back();
            }
            else
            {
                Ans.push_back(s),m--;
            }
        }
        while(S[id].p<n&&Tmp[P[S[id].d][S[id].p]])S[id].p++;
        if(Q.size()<m&&(S[id].p<n||(S[id].p<n+s.size()&&!((s[S[id].p-n].first>>S[id].d)&1)))&&(S[id].o||s.empty()))
        {
            S.push_back(S[id]),S.back().y=1;
            if(S[id].p<n)S.back().Q.push_back({(A[P[S[id].d][S[id].p]]>>S[id].d|1)<<S[id].d,P[S[id].d][S[id].p]});
            else S.back().Q[S[id].p-n].first|=1llu<<S[id].d;
            S.back().p++,S.back().ok=1,S.back().o^=1;
            if(S[id].o||GetValue(S.back())==w)Q.push_back(S.size()-1);
            if(Q.size()<m)
            {
                S[id].p++,S[id].y=0;
                if(GetValue(S[id])==w)Q.push_back(id);
            }
        }
        for(auto p:s)Tmp[p.second]=0;
    }
    // Ans.clear();
    printf("%u\n",(uint)Ans.size());
    for(auto s:Ans)
    {
        std::sort(s.begin(),s.end(),[&](Pair a,Pair b){return a.second<b.second;});
        printf("%u\n",(uint)s.size());
        if(s.empty())puts("\n");
        else
        {
            for(auto p:s)printf("%u%c",p.second+1," \n"[p.second==s.back().second]);
            for(auto p:s)printf("%llu%c",p.first-A[p.second]," \n"[p.second==s.back().second]);
        }
    }
}

int main()
{
    uint c,t;scanf("%u%u",&c,&t);
    while(t--)solve();
    return 0;
}