#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define pii pair<int,int>
#define vpii vector<pii >
#define all(a) a.begin(),a.end()
using namespace std;
const int INF=1<<30;
inline void read(int &x){
//	short neg=1;
	x=0;
	char c=getchar();
	/*while(c<'0'||c>'9'){
		if(c=='-')neg=-1;
		c=getchar();
	}*/
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+(c^48),c=getchar();
	}
//	x*=neg;
}
int t;
int n;
pair<ll,int> a[200020];
ll sum[200020];
bool check(int pos){
	int it=upper_bound(a,a+n,mp(a[pos].fi+sum[pos],INF))-a;
	while(it<n&&sum[it]>=a[it].fi)it=upper_bound(a,a+n,mp(sum[it],INF))-a;
	if(it==n)return 1;
	return 0;
}
int main(void){
	cin>>t;
	REP(ii,t){
		cin>>n;
		REP(i,n){
			cin>>a[i].fi;
			a[i].se=i+1;
		}
		sort(a,a+n);
		sum[0]=0;
		REPA(i,n-1){
			sum[i]=sum[i-1]+a[i-1].fi;
		}
		REP(i,n){
			if(check(i)){
				cout<<n-i<<endl;
				vi ans;
				FORN(j,i,n)ans.pb(a[j].se);
				sort(all(ans));
				REP(j,(int)ans.size())cout<<ans[j]<<' ';
				cout<<endl;
				break;
			}
		}
	}
	return 0;
}
