#include<bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define pii pair<int , int>

typedef long long int ll;
typedef long double ld;

using namespace std;

const ll maxn = 2e5 + 10 , inf = 3e18 , mod = 1e9 + 7 , LOG = 8;

ll t , n , sum[maxn];
pair<ll , ll> a[maxn];

bool check(ll here){
	if(here == n - 1) return true;
	ll test = sum[here];
	while(test >= a[here + 1].F && here < n - 1){
		here++;
		test += a[here].F;
	}
	if(here == n - 1) return true;
	return false;
}

void solve(){
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> a[i].F;
		a[i].S = i + 1;
	}
	sort(a , a + n);
	sum[0] = a[0].F;
	for(int i = 1;i < n;i++){
		sum[i] = sum[i - 1] + a[i].F;
	}
	ll l = -1 , r = n - 1 , mid;
	while(l != r - 1){
		mid = (l + r)/2;
		if(check(mid)){
			r = mid;
		}
		else{
			l = mid;
		}
	}
	cout << n - r << endl;
	vector<ll> ans;
	for(int i = r;i < n;i++){
		ans.pb(a[i].S);
	}
	sort(ans.begin() , ans.end());
	for(int i : ans)
		cout << i << " ";
	cout << endl;
	fill(sum , sum + n , 0);
}

int main(){
	
	ios::sync_with_stdio(false) , cin.tie(0) , cout.tie(0);
	
	
	cin >> t;
	while(t--){
		solve();
	}

	return 0;
}

/*



*/
