#include <bits/stdc++.h>
using namespace std;
const int N = 4100010;
long long R() {
  long long ans = 0, f = 1;
  char c = getchar();
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) ans = ans * 10 + c - '0';
  return ans * f;
}
int n, m, l1, l2;
int q[N], tp, a[N];
int Fd(int u) {
  if (a[(u << 1)] == 0 && a[(u << 1 | 1)] == 0) return u;
  if (a[(u << 1)] > a[(u << 1 | 1)]) return Fd((u << 1));
  return Fd((u << 1 | 1));
}
void ff(int u) {
  if (a[(u << 1)] == 0 && a[(u << 1 | 1)] == 0) {
    a[u] = 0;
    return;
  }
  if (a[(u << 1)] > a[(u << 1 | 1)]) {
    a[u] = a[(u << 1)];
    ff((u << 1));
  } else {
    a[u] = a[(u << 1 | 1)];
    ff((u << 1 | 1));
  }
}
void Sol(int u) {
  if (u > l2) return;
  while (Fd(u) > l2) {
    q[++tp] = u;
    ff(u);
  }
  Sol((u << 1));
  Sol((u << 1 | 1));
}
void Work() {
  tp = 0;
  l1 = (1 << R()) - 1;
  l2 = (1 << R()) - 1;
  for (int i = 1; i <= l1; ++i) a[i] = R();
  Sol(1);
  long long ans = 0;
  for (int i = 1; i <= l2; ++i) ans += a[i];
  cout << ans << '\n';
  for (int i = 1; i <= tp; ++i) cout << q[i] << ' ';
  cout << '\n';
  for (int i = 1; i <= l1; ++i) a[i] = 0;
}
int main() {
  int t = R();
  while (t--) Work();
  return 0;
}
