#include <bits/stdc++.h>
#define forn(i,n) for(ll i=0; i<n; i++)
#define pb push_back
#define ll long long int
#define mp make_pair
#define sz(arr) (ll)arr.size()
#define MOD 1000000007
using namespace std;

int main(){
	ll T;
	cin>>T;
	while (T--){
		ll n;
		cin>>n;
		vector<pair<ll,ll> > arr(n);
		forn(i,n){
			cin>>arr[i].first;
			arr[i].second=i;
		}
		
		sort(arr.begin(),arr.end());
		ll tot=0;
		forn(i,n) tot+=arr[i].first;
		vector<ll> ans;
		for(ll i=n-1;i>=0; i--){
			tot-=arr[i].first;
			if (arr[i].first>tot){
				for(ll j=i; j<n; j++) ans.pb(arr[j].second+1);
				break;
			}
		}
		sort(ans.begin(),ans.end());
		cout<<sz(ans)<<"\n";
		forn(i,sz(ans)) cout<<ans[i]<<" ";
		cout<<"\n";
		
	}
	
}
