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

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const int N = 1e6 + 200;

int n;
int p[N], u[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        u[i] = 0;
        cin >> p[i];
    }
    vector<int> ans;
    int v = 1;
    while (u[v] == 0) {
        u[v] = 1;
        ans.push_back(v);
        v = p[v];
    }
    if (ans.size() < n) {
        cout << n << "\n" << ans.size() << '\n';
        sort(all(ans));
        for (int i : ans) cout << i << " ";
        cout << '\n';
        return;
    }
    int mn = n, pos = -1;
    for (int i = 1; i <= n; ++i) {
        if (mn > abs(i - p[i])) {
            mn = abs(i - p[i]);
            pos = i;
        }
    }
    cout << n - 1 - mn << "\n1\n" << pos << '\n';
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
}