#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)

using namespace std;
const int N = 1e6 + 10;
int a[N], n;

void sol() {
    cin >> n;
    vector<int> pos(n + 1);
    F(i, 1, n) cin >> a[i], pos[a[i]] = i;
    vector<int> vst(n + 1);
    F(i, 1, n) if(! vst[i]) {
        int x = i;
        vector<int> tmp;
        while(! vst[x]) {
            vst[x] = 1;
            tmp.push_back(x);
            x = a[x];
        }
        // cout << tmp.size() << "?\n";
        if(tmp.size() != n) {
            cout << n << "\n";
            cout << tmp.size() << "\n";
            for(auto x : tmp) cout << x << " "; cout << "\n";
            return;
        } else {
            if(n == 2) {
                cout << 0 << "\n" << 1 << "\n" << 1 << "\n";
                return;
            } 
            int res = 0, ans;
            F(i, 1, n) {
                int tmp = 0;
                if(a[i] < i) tmp = a[i] - 1 + n - i;
                else tmp = i - 1;
                if(tmp > res) res = tmp, ans = i;
            }
            cout << res << "\n" << 1 << "\n" << ans << "\n";
            return;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}