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

void solve(){
    int n;
    cin >> n;
    vector<int>a(n);
    for(auto &x : a){
        cin >> x;
        x--;
    }
    vector<int>cycle;
    int j = 0;
    cycle.push_back(j);
    while(a[j] != 0){
        if((int)cycle.size() == n)break;
        j = a[j];
        cycle.push_back(j);
    }
    if((int)cycle.size() != n){
        cout << n << '\n';
        cout << cycle.size() << '\n';
        for(auto x : cycle)cout << x + 1 << ' ';
        cout << '\n';

    } else {
        int best = n;
        int best_i = 0;
        for(int i = 0; i < n; i++){
            if(abs(a[i] - i) < best){
                best = abs(a[i] - i);
                best_i = i;
            }
        }
        cout << n - best - 1 << '\n';
        cout << 1 << '\n';
        cout << best_i + 1 << '\n';
    }
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--)solve();
}