#include <bits/stdc++.h>
using namespace std;
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> P) {
  for (auto const &vv : P) os << "(" << vv.first << "," << vv.second << ")";
  return os;
}
template <class T>
ostream &operator<<(ostream &os, set<T> V) {
  os << "[";
  for (auto const &vv : V) os << vv << ",";
  os << "]";
  return os;
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto const &vv : V) os << vv << ",";
  os << "]";
  return os;
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  os << "(" << P.first << "," << P.second << ")";
  return os;
}
inline int fstoi(const string &str) {
  auto it = str.begin();
  bool neg = 0;
  int num = 0;
  if (*it == '-')
    neg = 1;
  else
    num = *it - '0';
  ++it;
  while (it < str.end()) num = num * 10 + (*it++ - '0');
  if (neg) num *= -1;
  return num;
}
inline void getch(char &x) {
  while (x = getchar_unlocked(), x < 33) {
    ;
  }
}
inline void getstr(string &str) {
  str.clear();
  char cur;
  while (cur = getchar_unlocked(), cur < 33) {
    ;
  }
  while (cur > 32) {
    str += cur;
    cur = getchar_unlocked();
  }
}
template <typename T>
inline bool sc(T &num) {
  bool neg = 0;
  int c;
  num = 0;
  while (c = getchar_unlocked(), c < 33) {
    if (c == EOF) return false;
  }
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48;
  if (neg) num *= -1;
  return true;
}
template <typename T, typename... Args>
inline void sc(T &num, Args &...args) {
  bool neg = 0;
  int c;
  num = 0;
  while (c = getchar_unlocked(), c < 33) {
    ;
  }
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48;
  if (neg) num *= -1;
  sc(args...);
}
int n, m;
int h, g;
int a[4000007];
int valind[4000007];
int itt = 0;
bool d1(int v) {
  assert(v <= n);
  assert(v > 0);
  if (a[v * 2] == 0 && a[v * 2 + 1] == 0) {
    if (v < (1 << g)) {
      return false;
    }
    valind[a[v]] = -1;
    a[v] = 0;
  } else {
    assert(v * 2 + 1 <= n);
    if (a[v * 2] > a[v * 2 + 1]) {
      int nval = a[v * 2];
      if (!d1(v * 2)) return false;
      a[v] = nval;
      valind[nval] = v;
    } else {
      int nval = a[v * 2 + 1];
      if (!d1(v * 2 + 1)) return false;
      a[v] = nval;
      valind[nval] = v;
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  sc(t);
  while (t--) {
    sc(h, g);
    n = (1 << h) - 1;
    m = (1 << g) - 1;
    for (auto i = (1); i <= (n); ++i) sc(a[i]);
    for (auto i = (n + 1); i <= (n * 2 + 7); ++i) {
      a[i] = 0;
    }
    for (auto i = (1); i <= (n); ++i) {
      valind[a[i]] = i;
    }
    int it = n;
    std::vector<int> resvec;
    int64_t res = accumulate(a + 1, a + n + 1, 0ll);
    for (auto v = (1); v <= (n); ++v) {
      while (a[v] != 0) {
        int cr = a[v];
        if (d1(v)) {
          res -= cr;
          resvec.push_back(v);
        } else {
          break;
        }
      }
    }
    cout << res << '\n';
    for (auto &i : resvec) {
      cout << i << ' ';
    }
    cout << '\n';
  }
}
