#include <bits/stdc++.h>
//#include <windows.h>
#define ED cerr<<endl;
#define TS cerr<<"I AK IOI"<<endl;
#define cr(x) cerr<<x<<endl;
#define cr2(x,y) cerr<<x<<" "<<y<<endl;
#define cr3(x,y,z) cerr<<x<<" "<<y<<" "<<z<<endl;
#define cr4(x,y,z,w) cerr<<x<<" "<<y<<" "<<z<<" "<<w<<endl;
#define pii pair<int,int>
#define mk make_pair
#define fi first
#define se second
#define ll long long
//#define ull unsigned long long
using namespace std;
const int N=1e6+5,INF=2e9,mod=1e9+7;
int t,n,m;
int ne[N],vis[N];
vector<int> s;

void sol() {
	scanf("%d",&n);
	for(int i=1;i<=n;++i) {
		scanf("%d",&ne[i]);
		vis[i]=0;
	}
	int cnt=0;
	for(int i=1;i<=n;++i) {
		if(!vis[i]) {
			int p=i;++cnt;
			s.clear();
			while(!vis[p]) {
				s.emplace_back(p);
				vis[p]=1,p=ne[p];
			}
		}
	}
	if(cnt>=2) {
		//TS
		printf("%d\n%d\n",n,s.size());
		for(auto it:s) printf("%d ",it);
	}
	else {
		int fnd1,fnd2;
		for(int i=1;i<=n;++i) {
			if(ne[i]==1) fnd1=i;
			else if(ne[i]==2) fnd2=i;
		}
		swap(ne[fnd1],ne[fnd2]);
		int p=1;s.clear();
		while(vis[p]!=2) {
			s.emplace_back(p);
			vis[p]=2,p=ne[p];
		}
		printf("%d\n%d\n",n-2,s.size());
		for(auto it:s) printf("%d ",it);
	}
	puts("");
}

int main()
{
	scanf("%d",&t);
	while(t--) {
		sol();
	}
	return 0;
}