#include <bits/stdc++.h>
using namespace std;
int a[1 << 21], ops[1 << 20];
int h, g;
int qq[24], qn;
int f(int id) {
  int tmp = a[id];
  a[id] = 0;
  qn = 0;
  qq[qn++] = id;
  while (id * 2 < (1 << h) && a[id] < max(a[id << 1], a[(id << 1) | 1])) {
    if (a[id << 1] > a[(id << 1) | 1]) {
      swap(a[id << 1], a[id]);
      id <<= 1;
    } else {
      swap(a[(id << 1) | 1], a[id]);
      id = (id << 1) | 1;
    }
    qq[qn++] = id;
  }
  if (id < (1 << g)) {
    for (int i = qn - 1; i > 0; i--) {
      a[qq[i]] = a[qq[i - 1]];
    }
    a[qq[0]] = tmp;
    return 0;
  }
  return tmp;
}
int main() {
  ios_base::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    cin >> h >> g;
    long long ans = 0;
    for (int i = 1; i < (1 << h); ++i) {
      cin >> a[i];
      ans += a[i];
    }
    int ptr = 0;
    for (int i = 1; i < (1 << g); ++i) {
      while (1) {
        int v = f(i);
        if (v) {
          ans -= v;
          ops[ptr++] = i;
        } else
          break;
      }
    }
    cout << ans << endl;
    for (int i = 0; i < ptr; ++i) {
      cout << ops[i] << ' ';
    }
    cout << endl;
  }
}
