#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma optimize("g", on)
#pragma GCC optimize("03")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#define int long long
#define all(x) x.begin(),x.end()
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
const int LG = 20,N = 1e6+1,inf = 1e18,MOD = 998244353;
const double eps = 1e-9;
int T;
void solve() {
int n;
cin>>n;
int a[n+1];
map<int,int> last;
int nxt[n+1]={};
for(int i=1;i<=n;i++){
cin>>a[i];
nxt[last[a[i]]]=i;
last[a[i]]=i;
}
for(int i=1;i<=n;i++){
if(nxt[i]){
for(int j=i;j<nxt[i];j++){
cout<<a[i]<<'\n';
}
i=nxt[i]-1;
}
else{
cout<<a[i]<<'\n';
}
}
return;
}
signed main() {
// freopen("deleg.in","r",stdin);
// freopen("deleg.out","w",stdout);
SS
int t = 1;
if (T) {
cin >> t;
}
while (t--) {
solve();
}
}
/*
29-16=21
*/
