#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int N=1000013;
const int mod=998244353;
int p[N],ip[N];
int g[N],pre[N];
vector<int>v[200012];
void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>p[i],ip[p[i]]=i,g[i]=0,v[i].clear();
    vector<int>o,x;
    for(int i=1;i<=n;i++){
        if(o.empty()||o.back()<p[i]){
            o.push_back(p[i]);
            if(o.size()>1)pre[p[i]]=o[o.size()-2];
        }
        auto id=std::lower_bound(o.begin(), o.end(), p[i])-o.begin();
        o[id]=p[i];
    }
    int s=(int)o.size();
    for(int i=s-2;~i;i--)o[i]=pre[o[i+1]];
    for(int i=0;i<s;i++)x.push_back(ip[o[i]]),g[x.back()]=1;
    cout<<n+s<<'\n';
    for(int i=1;i<=n;i++)if(!g[i]){
        auto id=std::lower_bound(o.begin(), o.end(),p[i])-o.begin();
        auto id2=std::lower_bound(x.begin(),x.end(),i)-x.begin();
        v[max(id,id2)].push_back(i);
    }

    for(int i=0;i<s;i++){
        cout<<x[i]<<' ';
        std::sort(v[i+1].begin(), v[i+1].end(),[&](int f,int g){
            if((f>x[i])!=(g>x[i]))return ((f>x[i])<(g>x[i]));
            if(f>x[i])return f<g;
            return p[f]<p[g];
        });
        for(auto y:v[i+1])cout<<y<<' ';
    }
    cout<<'\n';
}

int main(){
    ios::sync_with_stdio(false);
    int T=1;
    cin>>T;
    while(T--)solve();
}