#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, n) {
        cin >> a[i];
        a[i]--;
    }

    vector<int> pos{0};
    int i = 0;
    while (a[i] != 0) {
        i = a[i];
        pos.push_back(i);
    }

    if (pos.size() < n) {
        cout << n << "\n";
        cout << pos.size() << "\n";
        rep(i, pos.size()) cout << pos[i] + 1 << " ";
        cout << "\n";
    } else {
        vector<int> ans(0);
        for (auto i : pos) {
            ans.push_back(i);
            if (a[i] == 1) break;
        }
        cout << n - 2 << "\n";
        cout << ans.size() << "\n";
        rep(i, ans.size()) cout << ans[i] + 1 << " ";
        cout << "\n";
    }
}

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