#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 5;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power((((a % mod) * (a % mod)) % mod), b / 2) % mod;
  else
    return ((a % mod) * (power((((a % mod) * (a % mod)) % mod), b / 2) % mod)) %
           mod;
}
int h, g;
int a[3000001];
int indu[3000001];
int indu1[3000001];
bool valid(int in, int init) {
  int nex = 2 * in;
  int nex1 = 2 * in + 1;
  int res = 0;
  if (a[nex] == 0 and a[nex1] == 0) {
    if (init < g) {
      return 0;
    } else {
      return 1;
    }
  } else {
    if (a[nex] > a[nex1]) {
      res |= valid(nex, init + 1);
    } else {
      res |= valid(nex1, init + 1);
    }
  }
  return res;
}
void dfs(int in) {
  int nex = 2 * in;
  int nex1 = 2 * in + 1;
  if (a[nex] == 0 and a[nex1] == 0) {
    a[in] = 0;
  } else {
    if (a[nex] > a[nex1]) {
      indu1[in] = indu1[nex];
      a[in] = a[nex];
      indu[indu1[in]] = in;
      dfs(nex);
    } else {
      indu1[in] = indu1[nex1];
      a[in] = a[nex1];
      indu[indu1[in]] = in;
      dfs(nex1);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    cin >> h >> g;
    int x = (1ll << h) - (1ll << g);
    set<pair<int, int>> s;
    for (int i = 1; i <= 1ll << (h + 1); i++) a[i] = 0;
    vector<pair<int, int>> v;
    for (int i = 1; i <= (1ll << h) - 1; i++)
      cin >> a[i], v.push_back({a[i], i}), indu[i] = i, indu1[i] = i;
    vector<int> ans;
    sort(v.begin(), v.end());
    int64_t fin = 0;
    while (x--) {
      pair<int, int> p = v[(int)v.size() - 1];
      int in1 = indu[p.second];
      if (valid(in1, (int)log2(in1))) {
        ans.push_back(in1);
        dfs(in1);
      } else {
        fin += p.first;
        x++;
      }
      v.pop_back();
    }
    for (auto j : v) {
      fin += j.first;
    }
    cout << fin << '\n';
    for (auto j : ans) cout << j << " ";
    cout << '\n';
  }
}
