#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template <typename T>
bool chmax(T &x, const T &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &x, const T &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
void in() {}
template <typename Head, typename... Tail>
void in(Head &&head, Tail &&...tail) {
  cin >> head;
  in(forward<Tail>(tail)...);
}
void out() { cout << '\n'; }
template <typename Head, typename... Tail>
void out(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  out(forward<Tail>(tail)...);
}
void outn() {}
template <typename Head, typename... Tail>
void outn(Head &&head, Tail &&...tail) {
  cout << head << '\n';
  outn(forward<Tail>(tail)...);
}
template <typename T, typename U>
void in(pair<T, U> &p) {
  cin >> p.first >> p.second;
}
template <typename T, typename U>
void out(pair<T, U> p) {
  cout << p.first << ' ' << p.second << '\n';
}
using vi = vector<int>;
using vll = vector<ll>;
template <typename T>
void vin(vector<T> &a) {
  for (int i = 0; i < (int)a.size(); i++) cin >> a[i];
}
template <typename T>
void vout(const vector<T> &a) {
  for (auto &e : a) cout << e << ' ';
  cout << '\n';
}
template <typename T>
void voutn(const vector<T> &a) {
  for (auto &e : a) cout << e << '\n';
}
template <typename T>
void unique(vector<T> &a) {
  sort(a.begin(), a.end()), a.erase(unique(a.begin(), a.end()), a.end());
}
vector<int> iota(int n) {
  vector<int> ret(n);
  iota(ret.begin(), ret.end(), 0);
  return ret;
}
template <typename T>
vector<int> iota(const vector<T> &a, bool greater = false) {
  vector<int> ret = iota((int)a.size());
  sort(ret.begin(), ret.end(),
       [&](int i, int j) { return (a[i] < a[j]) ^ greater; });
  return ret;
}
struct io_setup {
  io_setup() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout << fixed << setprecision(15);
  }
} io_setup;
const int MOD = 1000000007;
int h, g;
struct Graph {
  vector<vector<int>> es;
  vector<int> a;
  ll ans = 0;
  vector<int> keep;
  const int n;
  Graph(int n) : n(n) { es.resize(n), a.resize(n); }
  void add_edge(int from, int to, bool directed = false) {
    es[from].push_back(to);
    if (!directed) es[to].push_back(from);
  }
  void remove(int root, int d) {
    while (true) {
      if (a[root] == 0) return;
      int D = search(root, d);
      if (D <= g) break;
      keep.emplace_back(root);
      ans -= a[root], dfs(root);
    }
    remove(2 * root, d + 1), remove(2 * root + 1, d + 1);
  }
  int search(int root, int d) {
    int ptr = root;
    while (true) {
      if (ptr >= n / 2 || (a[2 * ptr] == 0 && a[2 * ptr + 1] == 0)) break;
      if (a[2 * ptr] > a[2 * ptr + 1])
        ptr = 2 * ptr, d++;
      else
        ptr = 2 * ptr + 1, d++;
    }
    return d;
  }
  void dfs(int ptr) {
    if (ptr >= n / 2 || (a[2 * ptr] == 0 && a[2 * ptr + 1] == 0))
      a[ptr] = 0;
    else if (a[2 * ptr] > a[2 * ptr + 1])
      a[ptr] = a[2 * ptr], dfs(2 * ptr);
    else
      a[ptr] = a[2 * ptr + 1], dfs(2 * ptr + 1);
  }
  void solve() {
    for (int i = 1; i <= n - 1; i++) ans += a[i];
    remove(1, 1);
    out(ans), vout(keep);
  }
};
int main() {
  int T;
  in(T);
  while (T--) {
    in(h, g);
    Graph G(1 << h);
    for (int i = 1; i <= (1 << h) - 1; i++) in(G.a[i]);
    G.solve();
  }
}
