#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
void solve();
signed main() {
  srand(time(0));
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.setf(ios::fixed);
  cout.precision(10);
  solve();
  return 0;
}
const long long MOD = 998244353, MAXN = 3e6 + 10, INF = 1e9 + 10, BASE = 37;
long long used[MAXN];
long long pos[MAXN], id[MAXN], a[MAXN], b[MAXN], a2[MAXN];
set<long long> p[MAXN];
void dfs(long long v, vector<pair<long long, long long>> &tmp) {
  if (a[v] == 0) return;
  tmp.push_back({a[v], v});
  dfs(v * 2, tmp);
  dfs(v * 2 + 1, tmp);
}
void del2(long long v) {
  long long left = 2 * v;
  long long right = 2 * v + 1;
  if (a[left] == 0 && a[right] == 0) {
    a[v] = 0;
  } else {
    if (a[left] > a[right]) {
      pos[a[left]] = v;
      a[v] = a[left];
      del2(left);
    } else {
      pos[a[right]] = v;
      a[v] = a[right];
      del2(right);
    }
  }
}
void del1(long long v, long long el) {
  long long left = 2 * v;
  long long right = 2 * v + 1;
  if (a2[left] == 0 && a2[right] == 0) {
    a2[v] = 0;
  } else {
    if ((a2[left] < a2[right] && a2[left] != 0) || a2[right] == 0) {
      a2[v] = a2[left];
      del1(left, el);
    } else {
      a2[v] = a2[right];
      del1(right, el);
    }
  }
}
void add(long long v, long long el) {
  long long left = 2 * v;
  long long right = 2 * v + 1;
  if (a2[left] == 0 && a2[right] == 0) {
    return;
  } else {
    if ((a2[left] < a2[right] && a2[left] != 0) || a2[right] == 0) {
      swap(a2[left], a2[v]);
      add(left, el);
    } else {
      swap(a2[right], a2[v]);
      add(right, el);
    }
  }
}
void query() {
  long long h, g;
  cin >> h >> g;
  for (long long i = 1; i < (1 << h); ++i) {
    cin >> a[i];
  }
  for (long long v = (1 << g) - 1; v >= (1 << (g - 1)); --v) {
    vector<pair<long long, long long>> tmp;
    dfs(v, tmp);
    sort(tmp.begin(), tmp.end());
    b[v] = tmp[0].first;
    vector<long long> t2;
    for (auto it : tmp) {
      t2.push_back(it.second);
    }
    sort(t2.begin(), t2.end());
    long long t = 0;
    for (auto it : t2) {
      a2[it] = tmp[t++].first;
    }
  }
  for (long long v = (1 << (g - 1)) - 1; v >= 1; --v) {
    long long el = a[v];
    a2[v] = el;
    add(v, el);
    long long mx = max(b[v * 2], b[v * 2 + 1]);
    while (a2[v] <= mx) {
      del1(v, 0);
    }
    b[v] = a2[v];
  }
  long long ans = 0;
  for (long long v = 1; v <= (1 << g) - 1; ++v) {
    ans += b[v];
  }
  cout << ans << '\n';
  for (long long v = 1; v < (1 << g); ++v) {
    used[b[v]] = 1;
  }
  vector<long long> c;
  for (long long i = 1; i < (1 << h); ++i) {
    if (!used[a[i]]) {
      c.push_back(a[i]);
    }
  }
  for (long long v = 1; v < (1 << g); ++v) {
    used[b[v]] = 0;
  }
  reverse(c.begin(), c.end());
  for (long long i = 1; i < (1 << h); ++i) {
    pos[a[i]] = i;
  }
  for (auto it : c) {
    cout << pos[it] << " ";
    del2(pos[it]);
  }
  cout << '\n';
  for (long long i = 1; i < (1 << h); ++i) {
    a[i] = 0;
    a2[i] = 0;
    pos[a[i]] = 0;
  }
}
void solve() {
  long long t;
  cin >> t;
  for (long long i = 0; i < t; ++i) {
    query();
  }
}
