#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (a == 0) return 0;
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
long long rev(long long v) { return mpow(v, MOD - 2); }
void solve() {
  long long g, h;
  cin >> g >> h;
  long long sz1 = (1 << (g + 1)) + 5;
  long long a[sz1];
  long long c[sz1], c1[sz1];
  for (long long i = 0; i < sz1; i++) c[i] = c1[i] = a[i] = 0;
  for (long long i = 1; i < (1 << g); i++) {
    cin >> a[i];
  }
  for (long long i = (1 << g) - 1; i >= 1; i--) {
    c[i] = c[2 * i] + c[2 * i + 1] + 1;
  }
  for (long long i = (1 << h) - 1; i >= 1; i--) {
    c1[i] = c1[2 * i] + c1[2 * i + 1] + 1;
  }
  vector<pair<long long, long long> > vec;
  vector<long long> ans;
  long long cur = 1;
  for (long long i = 0; i < (1 << g) - (1 << h); i++) {
    long long lcur = cur;
    ans.push_back(lcur);
    while (1) {
      if (c[lcur] <= c1[lcur]) {
        i--;
        cur++;
        vec.clear();
        ans.pop_back();
        break;
      }
      long long l = a[2 * lcur], r = a[2 * lcur + 1];
      vec.push_back(make_pair(lcur, max(l, r)));
      if (l == 0 && r == 0) {
        break;
      } else if (l > r)
        lcur = 2 * lcur;
      else
        lcur = 2 * lcur + 1;
    }
    for (auto it : vec) {
      a[it.first] = it.second;
      c[it.first]--;
    }
    vec.clear();
  }
  long long tot = 0;
  for (long long i = 1; i < (1 << g); i++) {
    tot += a[i];
  }
  cout << tot << "\n";
  for (auto it : ans) cout << it << " ";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  cin >> t;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
