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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jeel Vaishnav
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CDrazilLikesHeap solver = new CDrazilLikesHeap();
        solver.solve(1, in, out);
        out.close();
    }

    static class CDrazilLikesHeap {
        int g;
        int h;
        long sum = 0;
        ArrayList<Integer> ans;
        int[] a;

        boolean check(int i, int level) {
            if (a[i] == 0)
                return false;

            if (level == h) {
                return true;
            }

            if (a[2 * i + 1] == 0 && a[2 * i + 2] == 0) {
                if (level > g)
                    return true;
                return false;
            }

            if (a[2 * i + 1] > a[2 * i + 2]) {
                return check(2 * i + 1, level + 1);
            } else
                return check(2 * i + 2, level + 1);
        }

        void doing(int i, int level) {
            if (level == h) {
                a[i] = 0;
                return;
            }

            if (a[2 * i + 1] == 0 && a[2 * i + 2] == 0) {
                a[i] = 0;
                return;
            }

            if (a[2 * i + 1] > a[2 * i + 2]) {
                a[i] = a[2 * i + 1];
                doing(2 * i + 1, level + 1);
            } else {
                a[i] = a[2 * i + 2];
                doing(2 * i + 2, level + 1);
            }
        }

        void dfs(int i, int level) {
            while (check(i, level)) {
//            System.out.println(i + " " + level);
//            for(int j = 0; j < ((1 << h) - 1); ++j)
//                System.out.print(a[j] + " ");
//            System.out.println();

                ans.add(i + 1);
                sum -= a[i];
                doing(i, level);
//            cnt++;
//            if(cnt > 5)
//                return;
            }

            if (level < h) {
                dfs(2 * i + 1, level + 1);
                dfs(2 * i + 2, level + 1);
            }
        }

        public void solve(int testNumber, InputReader sc, PrintWriter out) {
            int t = sc.nextInt();

            for (int x = 0; x < t; ++x) {
                h = sc.nextInt();
                g = sc.nextInt();

                int n = (1 << h) - 1;
                int removed = (1 << h) - (1 << g);
                a = new int[n];
                for (int i = 0; i < n; ++i)
                    a[i] = sc.nextInt();

                sum = 0;
                for (int i = 0; i < n; ++i)
                    sum += a[i];

                ans = new ArrayList<>();
                dfs(0, 1);

                out.println(sum);
                for (int i : ans)
                    out.print(i + " ");
                out.println();
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}