#include"bits/stdc++.h"
#include"bits/stdc++.h"

using lint = int64_t;

using namespace std;

void solve(){
    int n; cin>>n;
    vector<int> v(n), p(n);
    for(int i = 0; i <n; i++){
        cin>>v[i];
        v[i]--;
        p[v[i]] = i;
    }
    for(int i = 0; i <n; i++){
        if(v[i] == i){
            cout<<n<<"\n";
            cout<<1<<"\n";
            cout<<i+1<<"\n";
            return;
        }
    }
    if(n == 2){
        cout<<"0\n1\n1\n";
        return;
    }
    for(int i = 0; i <n; i++){
        int r = p[i];
        if(p[r] == i){
            cout<<n<<"\n";
            cout<<2<<"\n";
            cout<<i+1<<" "<<r+1<<"\n";
            return;
        }
    }
    vector<bool> vis(n);
    int edges = 0;
    for(int i = 0; i < n; i++){
        if(vis[i]) continue;
        if(edges == n-2) break;
        vis[i] = true;
        edges++;
        int cur = v[i];
        while(cur != i){
            if(edges == n-2) break;
            vis[cur] = true;
            vis[v[cur]] = true;
            edges++;
            cur = v[cur];
        }
    }
    int k = 0;
    for(int i = 0; i < n; i++)
        if(vis[i])
            k++;
    cout<<n-2<<"\n";
    vector<int> ans; ans.reserve(n);
    for(int i = 0; i < n; i++)
        if(vis[v[i]])
            ans.push_back(i+1);
    cout<<ans.size()<<"\n";
    for(int a : ans) cout<<a<<" ";
    cout<<"\n";

    return;

}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin>>t;
    while(t--) solve();

    return 0;
}