#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

void solve(){
    int N;cin>>N;
    vector<int> P(N),seen(N);
    for(int i=0;i<N;i++){
        cin>>P[i];P[i]--;
    }
    vector<vector<int>> ans;
    
    for(int i=0;i<N;i++){
        if(seen[i]) continue;
        ans.push_back({});
        int now=i;
        while(1){
            if(seen[now]) break;
            seen[now]=true;
            ans.back().push_back(now);
            now=P[now];
        }
    }
    
    if(si(ans)>=2){
        cout<<N<<"\n";
        cout<<si(ans[0])<<"\n";
        for(int x:ans[0]) cout<<x+1<<" ";
        cout<<"\n";
    }else{
        cout<<N-2<<"\n";
        cout<<1<<"\n";
        cout<<ans[0][0]+1<<"\n";
    }
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        solve();
    }
}