#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
void solve();
using pii = pair<int, int>; 
using db = double;
signed main(){
	fast
	int t = 1;
	cin >> t;
	for(int i = 1; i <= t; i++){
		solve();
	}
}

const int N = 1e6 + 10, M = N * 2, P = 998244353;

int n;
int a[N];
bool st[N];

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i], st[i] = 0;
	}
	int k = 0;
	for(int x = 1; !st[x]; x = a[x]){
		st[x] = 1, k++;
	}
	if(k != n){
		cout << n << '\n';
		cout << k << '\n';
		for(int i = 1; i <= n; i++){
			if(st[i]){
				cout << i << ' ';
			}
		}
		cout << '\n';
	}
	else{
		int mn = 2e9, pos = -1;
		for(int i = 1; i <= n; i++){
			if(mn > abs(a[i] - i) + 1){
				mn = abs(a[i] - i) + 1, pos = i;
			}
		}
		cout << n - mn << '\n';
		cout << 1 << '\n';
		cout << pos << '\n';
	}
}