#include<bits/stdc++.h>
using namespace std;
using ll = long long;

void solve()
{
    int n;
    cin>>n;
    vector<int> a(n+1);
    vector<int> vis(n+1);
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        if(a[i]==i)
        {
            cout<<n<<"\n";
            cout<<1<<"\n";
            cout<<i<<"\n";
            return;
        }
    }
    int col=0;
    vector p(n+1,vector<int>());
    for(int i=1;i<=n;i++)
    {
        int now=a[i];
        if(vis[now]) continue;
        col++;
        while(!vis[now]) {
            p[col].push_back(now);
            vis[now]=1;
            now=a[now];
        }
    }
    if(col>=2) {
        cout<<n<<"\n";
        cout<<p[1].size()<<"\n";
        sort(p[1].begin(),p[1].end());
        for(int &v: p[1])
            cout<<v<<" ";
        cout<<"\n";
        return;
    }
    if(n==2) {
        cout<<0<<"\n";
        cout<<1<<"\n";
        cout<<1<<"\n";
        return;
    }
    for(int i=1;i<=n;i++) {
        if(a[i]==i+1) {
            cout<<n-2<<"\n";
            cout<<1<<"\n";
            cout<<i<<"\n";
            return;
        }
    }
    assert(1);
}
int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int _=1;
    cin>>_;
    while(_--)
        solve();
}