1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4. #define endl "\n"
  5. #define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
  6. #define ALL(x) x.begin(),x.end()
  7. #define SORT(x) sort(ALL(x))
  8. #define FOR(a,b,c) for(ll (a)= (b);(a)<(c);++(a))
  9. #define REP(a,b) FOR(a,0,b)
  10. #define mp make_pair
  11. #define pb push_back
  12. #define pll pair<ll,ll>
  13. #define pii pair<int,int>
  14. #define vl vector<ll>
  15. #define vi vector<int>
  16. #define f first
  17. #define s second
  18. #define yy cout<<"YES"<<endl;return
  19. #define nn cout<<"NO"<<endl;return
  20. #define minus1 cout<<-1<<endl;return
  21. #define rd(a,x) REP(i,x)cin >> a[i]
  22. int ttt = 1, case_ = 0;
  23. ll n, m, k;
  24. string S;
  26. template <class myType>
  27. void print_arr(myType &arr, ll L, string sep){
  28. REP(i,L){ cout << arr[i] << (i < L-1 ? sep : "\n"); }
  29. return; }
  31. /*
  32. Solve the smallest problem I can at any time
  33. I can add index k to my pile when at least (k - 1)/2 problems have been solved
  34. When 0 problems solved, indices 0 and 1
  35. When 1 problem solved, indices 2 and 3
  36. When 2 problems solved, indices 4 and 5
  37. Etc
  38. */
  40. void solve() {
  41. cin >> n >> k;
  42. vl a(n);
  43. rd(a, n);
  44. priority_queue<pll, vector<pll>, greater<pll>> q;
  45. ll solved = 0, t = 0;
  46. vl ans;
  47. vector<bool> used(n, 0);
  48. while (1) {
  49. // add all problems I am now allowed to solve to the priority queue
  50. vl targ = {2*solved, 2*solved + 1};
  51. for(ll j: targ) {
  52. if (j >= n) continue;
  53. if (used[j]) continue;
  54. used[j] = 1;
  55. q.push(mp(a[j], j+1));
  56. }
  57. // if there are no problems in the PQ, I can't do anything, so break
  58. if (q.empty()) {
  59. break;
  60. }
  61. // take the shortest problem from the PQ. If it's too long to solve, break
  62. if (q.top().f + t <= k) {
  63. t += q.top().f;
  64. solved++;
  65. ans.pb(q.top().s);
  66. q.pop();
  67. }
  68. else {
  69. break;
  70. }
  71. }
  72. cout << solved << endl;
  73. if (solved) print_arr(ans, solved, " ");
  74. else cout << endl;
  75. return;
  76. }
  78. int main() {
  79. quick;
  80. cin >> ttt;
  81. while (ttt--) solve();
  82. return 0;
  83. }