#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;
#define FAST    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
#define all(n)  (n).begin(), (n).end()
#define SZ(n)       ((int)(n).size())
#define MOD      1000000007

const int N = 200050;
pair<int, int> p[N];
int n;
bool chk(int m){
	long long sum = p[m].first;
	for (int i = 0; i < n; i++){
		if (i == m) continue;
		if (sum < p[i].first){
			return false;
		}
		sum += p[i].first;
	}
  return true;
}
int main(){
FAST
   int T; cin >> T;
   while(T--){
    	cin >> n;
        for (int i = 0; i < n; i++){
        	cin >> p[i].first;
        	p[i].second = i;
        }
        sort(p, p + n);
        int l = 0, r = n;
	    while (l < r){
             int mid = l + (r - l) / 2;
             if (chk(mid)){
             	r = mid;
             }
             else l = mid + 1;
	    }
	    vector<int> ans;
        for (int i = r; i < n; i++){
            ans.push_back(p[i].second + 1);
        }
        sort(all(ans));
        cout << SZ(ans) << '\n';
        for (auto w : ans) cout << w << ' ';
        cout << '\n';
   
   }

  return 0;
}

