#include <bits/stdc++.h>
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
  std::chrono::time_point<std::chrono::system_clock> end;
  end = std::chrono::system_clock::now();
  std::chrono::duration<double> elapsed_seconds = end - start;
  std::time_t end_time = std::chrono::system_clock::to_time_t(end);
  cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
inline long long binexp(long long a, long long b, long long m) {
  if (a == 0) {
    return 0;
  }
  long long res = 1;
  a %= m;
  while (b) {
    if (b & 1) res = (res * 1ll * a) % m;
    a = (a * 1ll * a) % m;
    b >>= 1;
  }
  return res;
}
inline long long binmul(long long a, long long b, long long m) {
  a %= m;
  long long res = 0;
  while (b) {
    if (b & 1) {
      res = (res + a) % m;
    }
    a = (a + a) % m;
    b >>= 1;
  }
  return res;
}
long long h, g;
inline void check(vector<long long> &arr, long long id,
                  multiset<pair<long long, long long> > &ms,
                  vector<bool> &isRem) {
  long long flg = 0;
  long long i = id;
  vector<long long> res;
  while (arr[id]) {
    ms.erase({arr[id], id});
    isRem[id] = 0;
    res.push_back(id);
    if (arr[2 * id] > arr[2 * id + 1]) {
      arr[id] = arr[2 * id];
      id = 2 * id;
    } else {
      arr[id] = arr[2 * id + 1];
      id = 2 * id + 1;
    }
  }
  reverse(res.begin(), res.end());
  for (long long i : res) {
    if (arr[i] == 0)
      isRem[i] = 0;
    else if (i > g) {
      isRem[i] = 1;
    } else {
      if (arr[2 * i] > arr[2 * i + 1])
        isRem[i] = isRem[2 * i];
      else
        isRem[i] = isRem[2 * i + 1];
    }
    if (isRem[i]) ms.insert({arr[i], i});
  }
}
long long M[1 << 21];
inline void solve_me_senpai() {
  cin >> h >> g;
  h = 1 << h;
  g = 1 << g;
  h--, g--;
  vector<long long> arr(2 * h + 5, 0);
  vector<long long> values;
  long long sum = 0;
  for (long long i = 1; i <= h; i++) {
    cin >> arr[i];
    values.push_back(arr[i]);
    M[arr[i]] = i;
    sum += arr[i];
  }
  sort(values.rbegin(), values.rend());
  vector<long long> res;
  for (long long i : values) {
    long long id = M[i];
    while (arr[2 * id] != 0 or arr[2 * id + 1] != 0) {
      if (arr[2 * id] > arr[2 * id + 1])
        id = 2 * id;
      else
        id = 2 * id + 1;
    }
    if (id > g) {
      sum -= i;
      res.push_back(M[i]);
    } else
      continue;
    id = M[i];
    while (arr[id]) {
      if (arr[2 * id] > arr[2 * id + 1]) {
        M[arr[2 * id]] = id;
        arr[id] = arr[2 * id];
        id = 2 * id;
      } else {
        M[arr[2 * id + 1]] = id;
        arr[id] = arr[2 * id + 1];
        id = 2 * id + 1;
      }
    }
  }
  cout << sum;
  cout << "\n";
  for (long long i : res) cout << i << " ";
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  long long a = 1;
  while (t--) {
    solve_me_senpai();
    a++;
  }
  return 0;
}
