#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int p[N], vis[N];

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", &p[i]), vis[i] = 0;
        int flg = 0;
        for (int i = 1; i <= n; ++i) if (p[i] == i) {
            printf("%d\n", n);
            printf("%d\n", n - 1);
            for (int j = 1; j <= n; ++j) {
                if (j != i) printf("%d ", j);
            }
            puts("");
            flg = 1;
            break;
        }
        if (flg) continue;
        for (int i = 1; i <= n; ++i) {
            if (!vis[i]) {
                vector<int> p;
                while (!vis[i]) {
                    vis[i] = 1;
                    p.push_back(i), i = ::p[i];
                }
                if (p.size() < n) {
                    printf("%d\n", n);
                    printf("%d\n", p.size());
                    for (auto x : p) {
                        printf("%d ", x);
                    }
                    puts("");
                    flg = 1;
                    break;
                }
            }
        }
        if (flg) continue;
        pair<int, int> res = make_pair(0, 0);
        for (int i = 1; i <= n; ++i) {
            res = max(res, make_pair(n - abs(p[i] - i) - 1, i));
        }
        printf("%d\n", res.first);
        printf("%d\n", n - 1);
        for (int i = 1; i <= n; ++i) {
            if (i != res.second) {
                printf("%d ", i);
            }
        }
        puts("");
    }
    return 0;
}