#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

ll C[55][55];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    for (ll i=0; i<=50; i++)
        for (ll j=i; j<=50; j++)
        {
            if (i==j || i==0) C[i][j]=1;
            else C[i][j]=C[i][j-1]+C[i-1][j-1];
        }
    ll t; cin >> t;
    while (t--)
    {
        ll n, k; cin >> n >> k;
        auto state_to_num=[&](vector <ll> a)
        {
            ll m=a.size(), ans=1;
            for (ll i=m-2; i>=0; i-=2)
                ans+=C[i][n];
            for (ll i=1, ptr=0; i<=n; i++)
            {
                while (ptr<a.size() && a[ptr]==i) ptr++, i++;
                if (ptr==a.size()) break;
                ans+=C[m-ptr-1][n-i];
            }   
            return ans;
        };
        auto num_to_state=[&](ll k, ll parity)
        {
            vector <ll> ans;
            for (ll m=parity, val=0; val<k; val+=C[m][n], m+=2)
                if (val+C[m][n]>=k) for (ll i=1, num=m; i<=n && num<=m; i++)
                {
                    if (val+C[num-1][n-i]>=k) ans.pb(i), num--;
                    else val+=C[num-1][n-i];
                }
            return ans;
        };
        vector <ll> a(k);
        for (ll i=0; i<k; i++) cin >> a[i];
        ll s=state_to_num(a);
        a=num_to_state(s, (k+1)%2);
        cout << n << " " << a.size() << "\n";
        for (ll i:a) cout << i << " "; cout << "\n";
    }
}