#include <bits/stdc++.h>
int a[2000005];
int ans[2000005];
std::vector<int> set[2000005];
void preWork(int u, int p, int n) {
  set[p].push_back(a[u]);
  if (2 * u <= n) preWork(2 * u, p, n);
  if (2 * u + 1 <= n) preWork(2 * u + 1, p, n);
}
int max(int a, int b) { return a > b ? a : b; }
void solve(int u) {
  int l = 2 * u, r = 2 * u + 1;
  int p0 = 0, p1 = 0, size0 = set[l].size(), size1 = set[r].size();
  for (int i = 0; i < size0 + size1; i++) {
    if (p0 < size0 && (p1 == size1 || set[l][p0] < set[r][p1])) {
      set[u].push_back(set[l][p0]);
      p0++;
    } else {
      set[u].push_back(set[r][p1]);
      p1++;
    }
  }
  set[u].push_back(a[u]);
  p0 = 0;
  while (set[u][p0] <= max(ans[l], ans[r])) p0++;
  ans[u] = set[u][p0];
}
int isEmpty(int u, int n) {
  if (u > n || a[u] == 0)
    return 1;
  else
    return 0;
}
void delet(int u, int n) {
  int l = 2 * u, r = 2 * u + 1;
  if (isEmpty(l, n) && isEmpty(r, n))
    a[u] = 0;
  else {
    if (!isEmpty(l, n) && (isEmpty(r, n) || a[l] > a[r])) {
      a[u] = a[l];
      delet(l, n);
    } else {
      a[u] = a[r];
      delet(r, n);
    }
  }
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int h, g;
    scanf("%d%d", &h, &g);
    int n = (1 << h) - 1, m = (1 << g) - 1;
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    int start = 1 << (g - 1);
    for (int i = start; i <= m; i++) {
      preWork(i, i, n);
      std::sort(set[i].begin(), set[i].end());
      ans[i] = set[i][0];
    }
    for (int i = start - 1; i >= 1; i--) solve(i);
    long long sum = 0;
    for (int i = 1; i <= m; i++) {
      sum += (long long)ans[i];
    }
    printf("%lld\n", sum);
    for (int i = 1; i <= m; i++) {
      while (a[i] != ans[i]) {
        printf("%d ", i);
        delet(i, n);
      }
    }
    printf("\n");
    for (int i = 1; i <= n; i++) set[i].clear(), a[i] = 0;
  }
  return 0;
}
