#include <bits/stdc++.h>

using namespace std;

using i64 = long long;  

void solve(){
    int n;
    cin >> n;
    vector<int>p(n);
    for (int i = 0;i < n;i ++){
        cin >> p[i];
        p[i] --;
    }

    vector<int>vis(n);

    int len = 1;
    int x = 0;
    vis[0] = 1;
    vector<int>ans;
    ans.push_back(0);
    while (!vis[p[x]]){
        x = p[x];
        ans.push_back(x);
        vis[x] = 1;
        len ++;
    }

    if (len == n){
        cout << n - 2 << "\n";
        cout << n / 2 << "\n";
        for (int i = 0;i < n / 2;i ++){
            assert(ans[i] + 1 <= n and ans[i] + 1 >= 1);
            cout << ans[i] + 1 << " ";
        }
        cout << "\n";
    }else{
        cout << n << "\n";
        cout << ans.size() << "\n";
        for (auto c : ans){
            assert(c + 1 <= n and c + 1 >= 1);
            cout << c + 1<< " ";
        }
        cout << "\n";
    }
}

int main() {    
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T --){
        solve();
    }

    return 0;
}