#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403() {}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || (a.first == b.first && a.second <= b.second));
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
long long int T, n, i, j, k, in, cnt, l, r, u, v, x, y;
long long int m, h, g;
string s;
vector<long long int> a, c;
bool canRemove(long long int pos) {
  if (a[2 * pos] == 0 && a[2 * pos + 1] == 0) return c[pos];
  if (a[2 * pos] > a[2 * pos + 1]) return canRemove(2 * pos);
  return canRemove(2 * pos + 1);
}
void remove(long long int pos) {
  if (a[2 * pos] == 0 && a[2 * pos + 1] == 0) {
    a[pos] = 0;
    while (pos >= 1) {
      c[pos]--;
      pos /= 2;
    }
    return;
  }
  if (a[2 * pos] > a[2 * pos + 1]) {
    a[pos] = a[2 * pos];
    return remove(2 * pos);
  }
  a[pos] = a[2 * pos + 1];
  return remove(2 * pos + 1);
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> T;
  while (T--) {
    cin >> h >> g;
    a.clear();
    a.resize(2 * (1 << h));
    c.clear();
    c.resize(2 * (1 << h), 0);
    a.push_back(0);
    long long int sum = 0;
    for (i = (1); i <= ((1 << h) - 1); ++i) {
      cin >> a[i];
      sum += a[i];
    }
    for (long long int i = (1 << h) - 1; i > 0; --i) {
      c[i] = (i >= (1 << g));
      c[i] += c[2 * i];
      c[i] += c[2 * i + 1];
    }
    long long int cnt = (1 << h) - (1 << g);
    vector<long long int> b;
    for (long long int i = 1; i < (1 << h); ++i) {
      if (cnt == 0) break;
      if (canRemove(i)) {
        b.push_back(i);
        sum -= a[i];
        remove(i);
        cnt--;
        i--;
      }
    };
    ;
    assert(cnt == 0);
    cout << sum << "\n";
    for (auto x : b) cout << x << " ";
    cout << "\n";
  }
  aryanc403();
  return 0;
}
