#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second

pair<int,int> a[200010];

int main()
{
	int test,n,d;
	cin>>test;
	while (test--)
	{
		cin>>n;
		for (int i=1;i<=n;i++)
		{
			cin>>d;
			a[i]={d,i};
		}
		sort(a+1,a+n+1);
		int pos=0;
		long long psum=0;
		for (int i=1;i<=n;i++)
		{
			if (psum<a[i].f)
			{
				pos=i;
			}
			psum+=a[i].f;
		}
		cout<<n-pos+1<<"\n";
		for (int i=pos;i<=n;i++)
		{
			swap(a[i].f,a[i].s);
		}
		sort(a+pos,a+n+1);
		for (int i=pos;i<=n;i++)
		{
			cout<<a[i].f<<" ";
		}
		cout<<"\n";
	}
}