#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
const int N=2e5+10;
struct note{
	int x,wz;
	inline bool operator < (const note lyf) const {return x<lyf.x;}
}a[N];
int ti,n,ans;
ll sum[N];
bool b[N];

int main(void){
	for (scanf("%d",&ti); ti; --ti){
		scanf("%d",&n);
		for (int i=1; i<=n; ++i) b[i]=0;
		
		for (int i=1; i<=n; ++i) scanf("%d",&a[i].x),a[i].wz=i;
		sort(a+1,a+1+n);
		for (int i=1; i<=n; ++i) sum[i]=sum[i-1]+a[i].x;
		for (int i=n,j; i; i=j){
			j=i;
			while (a[j].x==a[i].x) --j;
			for (int k=j+1; k<i; ++k) sum[k]=sum[i];
		}
		b[a[n].wz]=1,ans=1;
		for (int i=n-1; i; --i){
			if (sum[i]<a[i+1].x) break;
			b[a[i].wz]=1,++ans;
		}
		printf("%d\n",ans);
		for (int i=1; i<=n; ++i) if (b[i]) printf("%d ",i);
		puts("");
	}
	return 0;
}