#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cassert>

#include <algorithm>
#include <cassert>
#include <vector>


#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder


namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
    explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) const {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) const {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) const {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using namespace std;
int naive(vector<int>P)
{
	auto f=[&](const vector<int>&Q){
		int ret=0;
		int qm=-1,pm=-1;
		for(int q:Q)
		{
			if(qm<q)qm=q,ret++;
			if(pm<P[q])pm=P[q],ret++;
		}
		return ret;
	};
	vector<int>Q(P.size());
	for(int i=0;i<P.size();i++)Q[i]=i;
	vector<vector<int> >CAN;
	int mx=0;
	do{
		int t=f(Q);
		if(mx<t)mx=t,CAN.clear();
		if(mx==t)CAN.push_back(Q);
	}while(next_permutation(Q.begin(),Q.end()));
	/*
	bool fn=false;
	for(vector<int>Q:CAN)
	{
		bool qo=true,po=true;
		for(int i=0;i<Q.size();i++)
		{
			if(Q[i]!=i)qo=false;
			if(P[Q[i]]!=i)po=false;
		}
		if(qo||po)fn=true;
	}
	if(!fn)
	{
		for(int p:P)cout<<p<<" ";cout<<endl;
		cout<<"ans = "<<mx<<endl;
		cout<<"CAN :"<<endl;
		for(vector<int>Q:CAN)
		{
			for(int q:Q)cout<<q<<" ";cout<<endl;
		}
		assert(fn);
	}
	*/
	return mx;
}
template <typename T>
vector<int> longest_increasing_sequence(const vector<T>& a) {
  int N = a.size();
  vector<pair<T, int>> dp;
  vector<int> p(N, -1);

  for (int i = 0; i < N; i++) {
    auto it = lower_bound(begin(dp), end(dp), make_pair(a[i], -i));
    if (it != begin(dp)) p[i] = -prev(it)->second;
    if (it == end(dp)) {
      dp.emplace_back(a[i], -i);
    } else {
      *it = make_pair(a[i], -i);
    }
  }

  vector<int> res;
  for (int i = -dp.back().second; i != -1; i = p[i]) res.push_back(i);
  reverse(begin(res), end(res));
  return res;
}
using dat=pair<int,int>;
dat op(dat a,dat b){return max(a,b);}
dat e(){return make_pair(-1,-1);}
int solve(const vector<int>&P)
{
	atcoder::segtree<dat,op,e>seg(P.size()+1);
	seg.set(0,make_pair(0,0));
	vector<int>pr(P.size()+1,-1);
	vector<int>inv(P.size()+1,-1);
	for(int i=1;i<=P.size();i++)
	{
		int v=P[i-1];
		inv[v]=i;
		dat t=seg.prod(0,v);
		pr[v]=t.second;
		seg.set(v,make_pair(t.first+1,v));
	}
	dat t=seg.all_prod();
	int ans=P.size()+t.first;
	vector<int>Q;
	Q.push_back(t.second);
	while(true)
	{
		int i=pr[Q.back()];
		if(i==0)break;
		Q.push_back(i);
	}
	reverse(Q.begin(),Q.end());
	for(int&q:Q)q=inv[q];
	vector<int>ret;
	int prv=0;
	priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;
	auto add=[&](int i){
		while(!pq.empty()&&pq.top().first<P[i-1])
		{
			ret.push_back(pq.top().second);
			pq.pop();
		}
		ret.push_back(i);
	};
	for(int q:Q)
	{
		for(int i=prv+1;i<q;i++)
		{
			if(P[i-1]<P[q-1])add(i);
			else pq.push(make_pair(P[i-1],i));
		}
		add(q);
		prv=q;
	}
	for(int i=prv+1;i<=P.size();i++)add(i);
	while(!pq.empty())
	{
		ret.push_back(pq.top().second);
		pq.pop();
	}
	auto f=[&](const vector<int>&Q){
		int ret=0;
		int qm=-1,pm=-1;
		for(int q:Q)
		{
			if(qm<q)qm=q,ret++;
			if(pm<P[q-1])pm=P[q-1],ret++;
		}
		return ret;
	};
	assert(ret.size()==P.size());
	assert(f(ret)==ans);
	for(int i=0;i<ret.size();i++)cout<<ret[i]<<(i+1==ret.size()?"\n":" ");
	return ans;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for(int N=1;false;N++)
	{
		cout<<"N = "<<N<<endl;
		vector<int>P(N);
		for(int i=0;i<N;i++)P[i]=i+1;
		do{
			//int ans=naive(P);
			int slv=solve(P);
			/*
			if(ans!=slv)
			{
				for(int p:P)cout<<p<<" ";cout<<endl;
				cout<<"ans = "<<ans<<" but slv = "<<slv<<endl;
				assert(false);
			}
			*/
		}while(next_permutation(P.begin(),P.end()));
	}
	int T;cin>>T;
	for(;T--;)
	{
		int N;cin>>N;
		vector<int>P(N);
		for(int i=0;i<N;i++)cin>>P[i];
		solve(P);
	}
}