#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"iostream"
#include"cassert"
#include"cmath"
#include"cstdio"
#include"cstdlib"
#include"map"
#include"set"
#include"queue"
#include"vector"
#include"algorithm"
#include"numeric"
#include"stack"
using namespace std;
typedef long long ll;
#define int ll
#define all(x) x.begin(), x.end()
inline int in(){int x;scanf("%lld",&x);return x;}
void solve(){
	int n=in();
	vector<pair<int,int>>a(n);
	int cur=0,sum=0;
	for(auto &i:a){i.first=in();sum+=i.first;i.second=++cur;}

	sort(a.rbegin(),a.rend());
	vector<int> sol;
	sol.push_back(a[0].second);
	sum-=a[0].first;
	for(int i=1;i<n;i++){
		if(sum>=a[i-1].first and sol.back()==a[i-1].second){
			sol.push_back(a[i].second);
		}
		sum-=a[i].first;
	}

	sort(all(sol));cout<<sol.size()<<"\n";
	for(int i:sol)cout<<i<<" ";
	cout<<"\n";
	

}
int32_t main()
{
	int t=in();while(t--)solve();

}

