#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(__CYGWIN__) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define ssz(x) (signed((x).size()))
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c - '0'); c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 1e5 + 5;
int c, T, n, m;
ll a[MAXN], b[MAXN];
vector<int> id[61], oper;
vector<vector<pair<int, ll>>> sol;
ll ans;
bool vis[MAXN];
ll getMin(int x, ll val) {
  ll cost = 0;
  vector<tuple<int, ll, bool>> upd;
  // cerr << "getMin " << val << ' ' << x << '\n';
  ForDown(i, x, 0) if (val >> i & 1) {
    ll msk = (1ll << i) - 1;
    int p = 0;
    for (int j : id[i])
      if (!vis[j]) {
        p = j;
        break;
      }
    if (!p)
      p = 1;
    assert(!(b[p] >> i & 1));
    ll dlt = msk + 1 - (b[p] & msk);
    val ^= b[p] ^ (b[p] + dlt);
    upd.eb(p, dlt, vis[p]), b[p] += dlt, cost += dlt, vis[p] = 1;
    // cerr << "G " << x << ' ' << i << ' ' << val << ' ' << dlt << '\n';
  }
  reverse(upd.begin(), upd.end());
  for (auto [x, y, z] : upd)
    b[x] -= y, vis[x] = z;
  return cost;
}
void dfs(int x, ll cur_cost, ll val) {
  if (x == -1) {
    auto qwq = oper;
    // cerr << ssz(oper) << '\n';
    sol.eb(ssz(qwq));
    For(i, 0, ssz(qwq) - 1) sol.back()[i] = {qwq[i], b[qwq[i]] - a[qwq[i]]};
    if (ssz(sol) >= m)
      throw 1;
    return;
  }
  if (!(val >> x & 1))
    return dfs(x - 1, cur_cost, val);
  bool ok = 1;
  ll msk = (1ll << x) - 1;
  for (int u : id[x])
    if (!vis[u]) {
      assert(!(b[u] >> x & 1));
      ll dlt = msk + 1 - (b[u] & msk);
      ll nv = val ^ b[u] ^ (b[u] + dlt);
      b[u] += dlt, vis[u] = 1;
      ll min_cost = cur_cost + dlt + getMin(x - 1, nv);
      if (min_cost == ans) {
        oper.eb(u);
        dfs(x - 1, cur_cost + dlt, nv);
        oper.pop_back();
      } else {
        b[u] -= dlt, vis[u] = 0, ok = 0;
        break;
      }
      b[u] -= dlt, vis[u] = 0;
    }
  if (ok) {
    auto qwq = oper;
    for (int u : qwq) {
      assert(!(b[u] >> x & 1));
      ll dlt = msk + 1 - (b[u] & msk);
      ll nv = val ^ b[u] ^ (b[u] + dlt);
      b[u] += dlt;
      ll min_cost = cur_cost + dlt + getMin(x - 1, nv);
      if (min_cost == ans) {
        dfs(x - 1, cur_cost + dlt, nv);
      } else {
        b[u] -= dlt, ok = 0;
        break;
      }
      b[u] -= dlt;
    }
  }
}
void Main() {
  read(c, T);
  while (T--) {
    read(n, m);
    sol.clear(), oper.clear(), memset(vis, 0, (n + 1));
    ll val = 0;
    ans = LLONG_MAX;
    For(i, 1, n) read(a[i]), val ^= a[i];
    For(i, 0, 60) {
      ll msk = (1ll << i) - 1;
      id[i].clear();
      For(j, 1, n) if (!(a[j] >> i & 1)) id[i].eb(j);
      sort(id[i].begin(), id[i].end(),
           [&](int x, int y) { return (a[x] & msk) > (a[y] & msk); });
    }
    auto solve = [&]() {
      ll cost = 0;
      ForDown(i, 59, 0) if (val >> i & 1) {
        pair<ll, int> minv = {LLONG_MAX, 0};
        ll msk = (1ll << i) - 1;
        For(j, 1, n) if (!(b[j] >> i & 1)) {
          cmin(minv, mkp(msk + 1 - (b[j] & msk), j));
        }
        assert(minv.se);
        cost += minv.fi;
        val ^= b[minv.se];
        b[minv.se] += minv.fi;
        val ^= b[minv.se];
      }
      return cost;
    };

    int flg = 0;
    ForDown(i, 59, 0) {
      if (val >> i & 1) {
        bool o = 1;
        For(j, 1, n) o &= a[j] >> i & 1;
        if (!o)
          break;
        For(j, i + 1, 60) {
          pair<ll, int> v1 = {LLONG_MAX, 0}, v2 = {LLONG_MAX, 0};
          ll msk2 = (1ll << j) - 1;
          For(k, 1, n) if (!(a[k] >> j & 1)) {
            auto cur = mkp(msk2 + 1 - (a[k] & msk2), k);
            if (cur <= v1)
              v2 = v1, v1 = cur;
            else
              cmin(v2, cur);
          }
          if (v1.se && v2.se) {
            copy(a + 1, a + 1 + n, b + 1);
            ll bak = val;
            assert(b[v1.se] == a[v1.se]);
            assert(b[v2.se] == a[v2.se]);
            val ^= b[v1.se] ^ b[v2.se];
            b[v1.se] += v1.fi, b[v2.se] += v2.fi;
            val ^= b[v1.se] ^ b[v2.se];
            cmin(ans, solve() + v1.fi + v2.fi);
            val = bak;
          }
        }
        flg = i;
        break;
      }
    }
    if (!flg) {
      ll val0 = val;
      copy(a + 1, a + 1 + n, b + 1), ans = solve();
      copy(a + 1, a + 1 + n, b + 1);
      try {
        dfs(59, 0, val0);
      } catch (int err) {
        assert(err == 1);
      }
    } else {
      copy(a + 1, a + 1 + n, b + 1);
      try {
        For(i, flg + 1, 60) {
          ll msk = (1ll << i) - 1;
          if (ssz(id[i]) < 2)
            continue;
          For(p, 0, ssz(id[i]) - 1) {
            int u = id[i][p];
            ll val1 = val, dlt = msk + 1 - (b[u] & msk);
            val1 ^= b[u] ^ (b[u] + dlt), b[u] += dlt, vis[u] = 1, oper.eb(u);
            For(q, p + 1, ssz(id[i]) - 1) {
              int v = id[i][q];
              ll dlt2 = msk + 1 - (b[v] & msk);
              val1 ^= b[v] ^ (b[v] + dlt2), b[v] += dlt2, vis[v] = 1,
                                                          oper.eb(v);
              ll cur = dlt + dlt2 + getMin(i - 1, val1);
              if (cur == ans)
                dfs(i - 1, dlt + dlt2, val1);
              oper.pop_back(), vis[v] = 0, b[v] -= dlt2,
                               val1 ^= b[v] ^ (b[v] + dlt2);
              if (cur != ans)
                break;
            }
            oper.pop_back(), vis[u] = 0, b[u] -= dlt;
          }
        }
      } catch (int err) {
        assert(err == 1);
      }
    }
    cout << ans << '\n' << ssz(sol) << '\n';
    for (auto &vec : sol) {
      cout << ssz(vec) << '\n';
      sort(vec.begin(), vec.end());
      for (auto [x, _] : vec)
        cout << x << ' ';
      cout << '\n';
      for (auto [_, y] : vec)
        cout << y << ' ';
      cout << '\n';
    }
  }
}
} // namespace

signed main() { return Main(), 0; }