#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 1000005
int vis[N],p[N],n;
void work()
{
	n=read();
	for(int i=1;i<=n;i++) p[i]=read();
	for(int i=1;i<=n;i++) vis[i]=0;
	{
		int cnt=0;
		int cur=1;
		while(!vis[cur]) cnt++,vis[cur]=1,cur=p[cur];
		if(cnt!=n)
		{
			printf("%d\n%d\n",n,cnt);
			for(int i=1;i<=n;i++) if(vis[i]) printf("%d ",i);
			printf("\n");
			return ;
		}
	}
	if(p[1]!=2)
	{
		for(int i=1;i<=n;i++) vis[i]=0;
		int cur=1,premn=p[1],cnt=0;
		while(1)
		{
			vis[cur]=1;
			cur=p[cur];
			cnt++;
			if(cur<premn) break;
		}
		printf("%d\n%d\n",n-2,cnt);
		for(int i=1;i<=n;i++) if(vis[i]) printf("%d ",i);
		printf("\n");
	}
	else
	{
		printf("%d\n%d\n",n-2,n-1);
		for(int i=2;i<=n;i++) printf("%d ",i);
		printf("\n");
	}
}
signed main()
{
	int T=read(); while(T--) work();
	return 0;
}