#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, N = 4e6 + 5, MOD = 1e9 + 7;
const long long INF_LL = 0x3f3f3f3f3f3f3f3fLL;
template <typename T>
inline int getplc(T x, int y) {
  return (x >> y) & 1;
}
template <typename T>
T square(T x) {
  return x * x;
}
long long qpow(long long a, long long b = MOD - 2, long long _MOD = MOD) {
  long long res = 1;
  for (; b; b >>= 1, a = a * a % _MOD) {
    if (b & 1) res = res * a % _MOD;
  }
  return res;
}
template <typename T>
T Smax(T x) {
  return x;
}
template <typename T, typename... Args>
T Smax(T a, Args... args) {
  return max(a, Smax(args...));
}
template <typename T>
T Smin(T x) {
  return x;
}
template <typename T, typename... Args>
T Smin(T a, Args... args) {
  return min(a, Smin(args...));
}
template <typename T>
void errl(istream_iterator<string> it) {}
template <typename T, typename... Args>
void errl(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  errl(++it, args...);
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << "=" << a << " # ";
  err(++it, args...);
}
int a[N], dep[N];
vector<int> ans;
void del(int x) {
  int l = x << 1, r = x << 1 | 1;
  if (a[l] == 0 && a[r] == 0) {
    a[x] = 0;
  } else {
    if (a[l] > a[r]) {
      a[x] = a[l];
      del(l);
    } else {
      a[x] = a[r];
      del(r);
    }
  }
}
int getdep(int x) {
  int l = x << 1, r = x << 1 | 1;
  if (a[l] == 0 && a[r] == 0) {
    return 0;
  } else {
    if (a[l] > a[r]) {
      return 1 + getdep(l);
    } else {
      return 1 + getdep(r);
    }
  }
}
void Solve() {
  int cas;
  for (cin >> cas; cas--;) {
    int n, m;
    cin >> n >> m;
    long long sum = 0;
    for (int i = 1; i <= (1 << (n)) - 1; i++) {
      cin >> a[i];
      sum += a[i];
    }
    dep[0] = 0;
    for (int i = 1; i <= (1 << (n)) - 1; i++) {
      dep[i] = dep[i / 2] + 1;
      if (a[i]) {
        while (dep[i] + getdep(i) > m) {
          sum -= a[i];
          ans.push_back(i);
          del(i);
        }
      }
    }
    cout << sum << '\n';
    for (auto p : ans) cout << p << " ";
    cout << '\n';
    for (int i = 1; i <= (1 << (n)) - 1; i++) a[i] = 0;
    ans.clear();
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  Solve();
  return 0;
}
