#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
constexpr int mod = 998244353;
constexpr int N = 1e6 + 10;

template <typename T>
struct BIT {
    const int maxn;
    vector<T> c;
    BIT(int n) : maxn(n), c(n + 1) {}
    int lowbit(int x) { return x & -x; }
    void insert(int x, T val) { // 注意 x > 0, 且同一个位置插入的值必须单调不减
        for (; x <= maxn; x += lowbit(x)) {
            c[x] = max(c[x], val);
        }
    }
    T query(int x) {
        T ans = 0;
        for (; x; x -= lowbit(x)) ans = max(ans, c[x]);
        return ans;
    }
};
void solve() {
    int n;
    cin >> n;
    vector<int> p(n + 1), pos(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        pos[p[i]] = i;
    }
    int ans = 0;
    BIT<int> bit(n);
    vector<int> dp(n + 1);
    vector<vector<int>> len(n + 1);
    for (int i = 1; i <= n; i++) {
        dp[i] = bit.query(p[i]) + 1;
        bit.insert(p[i], dp[i]);
        len[dp[i]].push_back(i);
        ans = max(ans, dp[i]);
    }
    if (ans == 1) {
        cout << "1 0\n";
        return;
    }
    int x = -1;
    vector<int> lis;
    priority_queue<int> q;
    for (int i = n; i >= 1; i--) {
        if (dp[i] == 2) q.push(p[i]);
        if (dp[i] == 1 && !q.empty() && p[i] < q.top()) x = i;
    }
    lis.push_back(x);
    for (int i = 1; i <= n; i++) {
        if (i > lis.back() && p[i] > p[lis.back()] && dp[i] == lis.size() + 1) {
            lis.push_back(i);
        }
    }
    while (!q.empty()) q.pop();
    int j = 1;
    vector<int> del;
    for (auto i : lis) {
        while (j < i) q.push(p[j++]);
        while (!q.empty() && q.top() > p[i]) {
            del.push_back(pos[q.top()]);
            q.pop();
        }
        j = i + 1;
    }
    cout << ans << ' ' << del.size() << "\n";
    for (auto x : del) cout << x << ' '; cout << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tt = 1;
    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}