#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> pii;

void solve() {
    int n, m;
    cin >> n;

    m = n;
    vector<int> v(m + 1), find(m + 1), chose(m + 1);
    for (int i = 1; i <= m; i++) {
        cin >> v[i];
        find[v[i]] = i;
    }

    queue<int> q;
    vector<int> ans;
    q.push(find[1]);
    ans.push_back(find[1]);
    chose[find[1]] = 1;

    if (v[1] != find[1]) {
        q.push(v[1]);
        ans.push_back(v[1]);
        chose[v[1]] = 1;
    }
    ans.push_back(1);
    chose[1] = 1;

    while (!q.empty()) {
        int t = q.front();
        q.pop();

        if (chose[v[t]]) continue;
        ans.push_back(v[t]);
        q.push(v[t]);
        chose[v[t]] = 1;
    }

    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());

    if (ans.size() == n) {
        int add = 0;
        vector<int> now;
        for (int i = n - 1; i >= 0; i--) {
            add += ans[i];
            add -= v[ans[i]];
            now.push_back(ans[i]);
            if (add == -1) {
                cout << n - 2 << '\n';
                cout << now.size() << '\n';
                for (auto& it : now) cout << it << " ";
                cout << '\n';
                break;
            }
        }
    }
    else {
        cout << n << '\n';
        cout << ans.size() << "\n";
        for (auto& it : ans) cout << it << " ";
        cout << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}