{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou have a knapsack with the capacity of $$$W$$$. There are also $$$n$$$ items, the $$$i$$$-th one has weight $$$w_i$$$. \u003c/p\u003e\u003cp\u003eYou want to put some of these items into the knapsack in such a way that their total weight $$$C$$$ is at least half of its size, but (obviously) does not exceed it. Formally, $$$C$$$ should satisfy: $$$\\lceil \\frac{W}{2}\\rceil \\le C \\le W$$$. \u003c/p\u003e\u003cp\u003eOutput the list of items you will put into the knapsack or determine that fulfilling the conditions is impossible. \u003c/p\u003e\u003cp\u003eIf there are several possible lists of items satisfying the conditions, you can output any. Note that you \u003cspan class\u003d\"tex-font-style-bf\"\u003edon\u0027t\u003c/span\u003e have to maximize the sum of weights of items in the knapsack.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eEach test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \\le t \\le 10^4$$$). Description of the test cases follows.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains integers $$$n$$$ and $$$W$$$ ($$$1 \\le n \\le 200\\,000$$$, $$$1\\le W \\le 10^{18}$$$). \u003c/p\u003e\u003cp\u003eThe second line of each test case contains $$$n$$$ integers $$$w_1, w_2, \\dots, w_n$$$ ($$$1 \\le w_i \\le 10^9$$$)\u0026nbsp;— weights of the items.\u003c/p\u003e\u003cp\u003eThe sum of $$$n$$$ over all test cases does not exceed $$$200\\,000$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, if there is no solution, print a single integer $$$-1$$$. \u003c/p\u003e\u003cp\u003eIf there exists a solution consisting of $$$m$$$ items, print $$$m$$$ in the first line of the output and $$$m$$$ integers $$$j_1$$$, $$$j_2$$$, ..., $$$j_m$$$ ($$$1 \\le j_i \\le n$$$, \u003cspan class\u003d\"tex-font-style-bf\"\u003eall $$$j_i$$$ are distinct\u003c/span\u003e) in the second line of the output \u0026nbsp;— indices of the items you would like to pack into the knapsack.\u003c/p\u003e\u003cp\u003eIf there are several possible lists of items satisfying the conditions, you can output any. Note that you \u003cspan class\u003d\"tex-font-style-bf\"\u003edon\u0027t\u003c/span\u003e have to maximize the sum of weights items in the knapsack.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n1 3\n3\n6 2\n19 8 19 69 9 4\n7 12\n1 1 1 17 1 1 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\n1\n-1\n6\n1 2 3 5 6 7\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, you can take the item of weight $$$3$$$ and fill the knapsack just right.\u003c/p\u003e\u003cp\u003eIn the second test case, all the items are larger than the knapsack\u0027s capacity. Therefore, the answer is $$$-1$$$.\u003c/p\u003e\u003cp\u003eIn the third test case, you fill the knapsack exactly in half.\u003c/p\u003e"}}]}