#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int T,n,a[N],L=650;
signed main(){
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=0;i<n;i++) cin>>a[i];
		for(int j=1;j<=L;j++)
			for(int i=0;i<n;i++)
				a[(i+1)%n]=max(a[(i+1)%n]-a[i],0);
		vector<int>prt;
		for(int i=0;i<n;i++)
			if(a[i]>0&&a[(i-1+n)%n]==0)
				prt.push_back(i+1);
		cout<<prt.size()<<"\n";
		for(int k:prt) cout<<k<<" ";
		puts("");
	}
	return 0;
}