#include <bits/stdc++.h>

void solve_test() {
    int n;
    std::cin >> n;

    std::vector<int> v(1 + n);

    for (int i = 1; i <= n; i++)
        std::cin >> v[i];

    std::vector<bool> vis(1 + n);
    int node = 1;

    std::vector<int> cycle;

    while (!vis[node]) {
        vis[node] = true;
        cycle.push_back(node);
        node = v[node];
    }

    if (cycle.size() < n) {
        std::cout << n << "\n";
        std::cout << cycle.size() << "\n";
        for (auto it: cycle)
            std::cout << it << " ";
        std::cout << "\n";
        return;
    }

    int best_element = -1, best = n + 1;
    for (int i = 1; i <= n; i++) {
        int cnt_wrong = std::abs(i - v[i]) + 1;
        if (cnt_wrong < best) {
            best = cnt_wrong;
            best_element = i;
        }
    }

    std::cout << n - best << "\n";
    std::cout << "1\n" << best_element << "\n";
}

int main() {
    std::cin.tie(NULL);
    std::iostream::sync_with_stdio(false);

    int t;

    std::cin >> t;

    while (t--) solve_test();

    return 0;
}