#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int w=2e5+5;
int n;
struct node
{
	int x,y;
}s[w];
bool cmp(node x,node y)
{
	return x.x<y.x;
}
bool cmp2(node x,node y)
{
	return x.y<y.y;
}
bool ok(int x)
{
	ll ans=s[x].x;
	for(int i=1;i<=n;i++)
	{
		if(i==x)
			continue;
		if(ans>=s[i].x)
			ans+=s[i].x;
		else
			return 0;
	}
	return 1;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=1;i<=n;i++)
			scanf("%d",&s[i].x),s[i].y=i;
		sort(s+1,s+1+n,cmp);
		int l=1,r=n;
		while(l<=r)
		{
			int mid=l+r>>1;
			if(ok(mid))
				r=mid-1;
			else
				l=mid+1;
		}
		sort(s+l,s+n+1,cmp2);
		cout<<n-l+1<<endl;
		for(int i=l;i<=n;i++)
			printf("%d%c",s[i].y,i==n?'\n':' ');
	}
	return 0;
} 