#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
mt19937_64 rnd(time);
#define maxn 1000005
#define int long long

int read() {int x;cin>>x;return x;}

void solve() {
    int n = read(), res = n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) a[i] = read();
    vector<int> vis(n + 1);
    int pos = 1, cnt = 0;
    vector<int> an;
    while(!vis[pos]) {
        vis[pos] = 1; cnt += 1;
        pos = a[pos];
        an.push_back(pos);
    }
    if(cnt != n) {
        cout << n << "\n";
        cout << cnt << "\n";
        for(auto i : an) cout << i << " ";
        cout << "\n";
        return;
    }

    for(int i = 1; i <= n; i++) {
        int x = a[i], y = i;
        int ans = abs(x - y);
        res = min(res, ans);
        if(ans == 0) {
            cout << n << "\n";
            cout << 1 << "\n";
            cout << y << "\n";
            return;
        }
    }
    for(int i = 1; i <= n; i++) {
        int x = a[i], y = i;
        int ans = abs(x - y);
        if(ans == res) {
            cout << n - res - 1 << "\n";
            cout << 1 << "\n";
            cout << y << "\n";
            return;
        }
    }
}

signed main() {
    #ifdef ONLINE_JUDGE
        ios::sync_with_stdio(false);
        cin.tie(0);cout.tie(0);
    #else
        //freopen("a.in", "r", stdin);
    #endif

    int t = read();
    while(t--) solve();
    return 0;
}