#include<bits/stdc++.h>
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;
const int MAXN = 2e5+10,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int T,n,p[MAXN],q[MAXN];

int dp[MAXN],pre[MAXN];

struct BIT{
    int t[MAXN],p[MAXN];
    void reset(){fill(t+1,t+1+n,0);fill(p+1,p+1+n,0);}
    void mdf(int x,int v){
        int tmp = x;
        for(;x<=n;x+=lowbit(x))if(t[x] < v){
            t[x] = v; p[x] = tmp;
        }
    }
    int qry(int x){
        int S=0,pos=0;
        for(;x;x-=lowbit(x))if(S<t[x]){
            S = t[x]; pos = p[x];
        }
        return pos;
    }
}bit;

int arr[MAXN],vis[MAXN],tot;
vector<int> o[MAXN];

void solve(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>p[i],q[p[i]] = i,vis[i] = 0,o[i].clear();
    bit.reset();
    for(int i=1;i<=n;i++){
        pre[i] = bit.qry(q[i]);
        dp[i] = dp[p[pre[i]]]+1;
        bit.mdf(q[i],dp[i]);
    }
    int pos = 0; for(int i=1;i<=n;i++)if(dp[i] > dp[pos])pos = i;
    tot = 0;
    for(int u=pos;u;u=p[pre[u]])arr[++tot] = q[u],vis[u] = 1;
    reverse(arr+1,arr+1+tot);
    int mx = 0,cnt = 0;
    for(int i=1;i<=n;i++)if(vis[i])mx = q[i],cnt++;else{
        if(q[i] < mx)o[cnt].push_back(q[i]);
        else{
            int pos = lower_bound(arr+1,arr+1+tot,q[i])-arr-1;
            o[pos].push_back(q[i]);
        }
    }
    for(int i=1;i<=tot;i++){
        cout<<arr[i]<<" "; for(auto u : o[i])cout<<u<<" ";
    }
    cout<<"\n";
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>T;
    while(T--)solve();

    return 0;
}