#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e6 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int a[maxn];
int n, h, g;
int check(int x, int d) {
  while (d <= g) {
    x = a[x * 2] > a[x * 2 + 1] ? x * 2 : x * 2 + 1;
    ++d;
  }
  return a[x] != 0;
}
void op(int x) {
  int l = x * 2, r = x * 2 + 1;
  if (l >= n || !a[l] && !a[r]) {
    a[x] = 0;
  } else {
    if (a[l] > a[r])
      a[x] = a[l], op(l);
    else
      a[x] = a[r], op(r);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> h >> g;
    n = (1 << h) - 1;
    long long ret = 0;
    for (int i = 1; i <= n; ++i) {
      cin >> a[i];
      ret += a[i];
    }
    vector<int> ans;
    int res = (1 << h) - (1 << g);
    for (int i = 1; i <= h && res; ++i) {
      int l = 1 << (i - 1), r = (1 << i) - 1;
      for (int j = l; j <= r && res; ++j) {
        while (res && check(j, i)) {
          ans.push_back(j);
          ret -= a[j];
          --res;
          op(j);
        }
      }
    }
    cout << ret << "\n";
    for (auto &v : ans) cout << v << " ";
    cout << "\n";
  }
  return 0;
}
