#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 10007;

int lis(vector<int> a) {
    int n = a.size(), len = 0;
    vector<int> f(n + 1);
    for (int i = 0; i < n; ++i) {
        int l = 0, r = len, mid;
        while (l < r) {
            mid = l + r + 1 >> 1;
            if (f[mid] < a[i]) l = mid;
            else r = mid - 1;
        }
        len = max(len, r + 1);
        f[r + 1] = a[i];
    }
    return len;
}

void solve() {
    int n; cin >> n;
    vector<int> a(n + 1), p(n + 1);
    for (int i = 1; i <= n; ++i) cin >> a[i], p[a[i]] = i;
    vector<int> f(n + 1, INF), pre(n + 1);
    int len = 0;
    for (int i = 1; i <= n; ++i) {
        int l = 0, r = len, mid;
        while (l < r) {
            mid = l + r + 1 >> 1;
            if (f[mid] < p[i]) l = mid;
            else r = mid - 1;
        }
        len = max(len, r + 1);
        if (f[r] != INF) pre[i] = a[f[r]];
        f[r + 1] = p[i];
    }
    cout << len << ' ';
    vector<bool> need(n + 1);
    int now = a[f[len]];
    while (now) {
        need[p[now]] = 1;
        now = pre[now];
    }
    priority_queue<int> del;
    for (int i = n, lim = INF; i; --i) {
        if (need[i]) lim = min(lim, a[i]);
        else if (a[i] > lim) del.push(a[i]);
    }
    cout << del.size() << el;
    while (del.size()) {
        int t = del.top(); del.pop();
        cout << p[t] << ' ';
    }
    cout << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}