#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100011;
const long long INF = (1 << 29) + 123;
const long long MOD = 1000000007;
const long double PI = 4 * atan((long double)1);
template <typename T>
bool ckmin(T& a, const T& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
bool ckmax(T& a, const T& b) {
  return b > a ? a = b, 1 : 0;
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MX = (1 << 20) + 5;
vector<int> subtree[MX];
int heap[MX], ans[MX];
bool used[MX];
int n, m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int h, g;
    cin >> h >> g;
    n = (1 << h) - 1;
    m = (1 << g) - 1;
    memset(heap, 0, 4 * n + 4);
    memset(ans, 0, 4 * n + 4);
    for (int i = 0; i < n; i++) cin >> heap[i + 1];
    for (int i = 1; i <= n; i++) subtree[i].clear();
    for (int i = (n); i >= (1); i--) {
      subtree[i].push_back(heap[i]);
      if (2 * i <= n) {
        for (auto& a : subtree[2 * i]) subtree[i].push_back(a);
        for (auto& a : subtree[2 * i + 1]) subtree[i].push_back(a);
      }
      sort(subtree[i].begin(), subtree[i].end());
    }
    long long total = 0;
    for (int i = (m); i >= (1); i--) {
      for (auto& a : subtree[i]) {
        if (!used[a] && a > ans[2 * i] && a > ans[2 * i + 1]) {
          total += 1LL * a;
          used[a] = 1;
          ans[i] = a;
          break;
        }
      }
    }
    cout << total << endl;
    int c = 0;
    for (int i = (n); i >= (1); i--) {
      if (!used[heap[i]]) {
        c++;
        cout << i << " ";
      } else {
        used[heap[i]] = 0;
      }
    }
    assert(c == n - m);
    cout << endl;
  }
  return 0;
}
