Problem: Drazil likes heap very much. So he created a problem with heap:

There is a max heap with a height h implemented on the array. The details of this heap are the following:

This heap contains exactly 2^h - 1 distinct positive non-zero integers. All integers are distinct. These numbers are stored in the array a indexed from 1 to 2^h-1. For any 1 < i < 2^h, a[i] < a[\left ⌊{i/2}\right ⌋].

Now we want to reduce the height of this heap such that the height becomes g with exactly 2^g-1 numbers in heap. To reduce the height, we should perform the following action 2^h-2^g times:

Choose an index i, which contains an element and call the following function f in index i:

<image>

Note that we suppose that if a[i]=0, then index i don't contain an element.

After all operations, the remaining 2^g-1 element must be located in indices from 1 to 2^g-1. Now Drazil wonders what's the minimum possible sum of the remaining 2^g-1 elements. Please find this sum and find a sequence of the function calls to achieve this value.

Input

The first line of the input contains an integer t (1 ≤ t ≤ 70 000): the number of test cases.

Each test case contain two lines. The first line contains two integers h and g (1 ≤ g < h ≤ 20). The second line contains n = 2^h-1 distinct positive integers a[1], a[2], …, a[n] (1 ≤ a[i] < 2^{20}). For all i from 2 to 2^h - 1, a[i] < a[\left ⌊{i/2}\right ⌋].

The total sum of n is less than 2^{20}.

Output

For each test case, print two lines.

The first line should contain one integer denoting the minimum sum after reducing the height of heap to g. The second line should contain 2^h - 2^g integers v_1, v_2, …, v_{2^h-2^g}. In i-th operation f(v_i) should be called.

Example

Input


2
3 2
7 6 3 5 4 2 1
3 2
7 6 5 4 3 2 1


Output


10
3 2 3 1
8
2 1 3 1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 22;
int dep[maxn], a[maxn], n, now[maxn], tree[maxn];
struct node {
  int id, num;
  node(int id = 0, int num = 0) : id(id), num(num) {}
} v[maxn];
bool cmp(node a, node b) { return a.num > b.num; }
void build(int id, int l, int r) {
  tree[id] = now[id] = id;
  a[id] = a[id << 1] = a[id << 1 | 1] = 0;
  dep[id << 1] = dep[id << 1 | 1] = dep[id] + 1;
  if (l == r) return;
  int mid = (l + r) >> 1;
  build(id << 1, l, mid);
  build(id << 1 | 1, mid + 1, r);
}
int query(int id) {
  if (!a[tree[id]]) return 0;
  int L = tree[id << 1], R = tree[id << 1 | 1], ans = dep[tree[id]];
  if (a[L] > a[R])
    ans = max(ans, query(id << 1));
  else
    ans = max(ans, query(id << 1 | 1));
  return ans;
}
void update(int id) {
  if (!a[tree[id]]) return;
  dep[tree[id]]--;
  int L = tree[id << 1], R = tree[id << 1 | 1];
  if (a[L] > a[R]) {
    tree[id] = tree[id << 1];
    update(id << 1);
  } else {
    tree[id] = tree[id << 1 | 1];
    update(id << 1 | 1);
  }
  now[tree[id]] = id;
}
int ans[maxn];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    long long h, g, sum = 0, cnt = 0;
    scanf("%lld%lld", &h, &g);
    n = (1 << h) - 1, dep[1] = 1;
    build(1, 1, 1 << h);
    a[0] = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      v[i] = node(i, a[i]), sum += a[i];
    }
    sort(v + 1, v + 1 + n, cmp);
    for (int i = 1; i <= n; i++) {
      int f = query(now[v[i].id]);
      if (f - 1 >= g) {
        sum -= v[i].num;
        ans[++cnt] = now[v[i].id];
        update(now[v[i].id]);
      }
    }
    printf("%lld\n", sum);
    for (int i = 1; i <= cnt; i++) printf("%d ", ans[i]);
    printf("\n");
  }
  return 0;
}