#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define SZ(x) (int)(x.size())
#define all(x) begin(x), end(x)
#ifdef LOCAL
#define HEHE freopen("in.txt", "r", stdin);
#define debug(...) {cerr << #__VA_ARGS__ << " = "; dbg(__VA_ARGS__);}
#else
#define HEHE ios_base::sync_with_stdio(0), cin.tie(0);
#define debug(...) 7122;
#endif
using namespace std;

#define chmax(a, b) (a) = (a) > (b) ? (a) : (b)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)

#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
void dbg() { cerr << '\n'; }
template<typename T, typename ...U>
void dbg(T t, U ...u) { cerr << t << ' '; dbg(u...); }

#define int long long

struct DSU {
    int p[100005];
    int sz;
    int Find(int x) {
        return p[x] < 0 ? x : p[x] = Find(p[x]);
    }
    void Union(int a, int b) {
        a = Find(a); b = Find(b);
        if (a == b) return;
        if (-p[a] < -p[b]) swap(a, b);
        p[a] += p[b];
        p[b] = a;
        sz--;
    }
} dsu;

void solve() {
    int n; cin >> n;
    vector<int> a(n), p(n);
    FOR (i, 0, n - 1) cin >> a[i], a[i]--, p[a[i]] = i;
    vector<int> vis(n);
    int x = 0;
    vector<int> v;
    while (!vis[x]) {
        v.pb(x);
        vis[x] = 1;
        x = p[x];
    }
    if (v.size() != n) {
        cout << n << '\n';
        cout << v.size() << '\n';
        for (int i : v) cout << i + 1 << ' ';
        cout << '\n';
    }
    else {
        vector<int> v1, v2;
        FOR (i, 0, n - 1) dsu.p[i] = -1;
        dsu.sz = n;
        if (n == 2) {
            v1.pb(1);
        }
        else {
            FOR (i, 0, n - 1) {
                if (dsu.Find(a[p[i]]) != dsu.Find(p[i]) and dsu.sz > 2) {
                    dsu.Union(a[p[i]], p[i]);
                }
            }
            FOR (i, 0, n - 1) {
                if (dsu.Find(i) == dsu.Find(0)) {
                    v1.pb(i);
                }
            }
        }
        cout << n - 2 << '\n';
        sort(all(v1));
        v1.resize(unique(all(v1)) - v1.begin());
        cout << v1.size() << '\n';
        for (int i : v1) cout << i + 1 << ' ';
        cout << '\n';
    }
}

signed main() {
    HEHE
    int t; cin >> t;
    while (t--) solve();
}