#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
template<class A>void read(A&a){
    a=0;int c=getchar(),f=0;
    for(;!isdigit(c);c=getchar()) f|=c=='-';
    for(;isdigit(c);c=getchar()) a=a*10+(c^48);
    if(f) a=-a;
}
template<class A,class ...B>
void read(A&a,B&...b){read(a);read(b...);}
//read(x,y,z);
template<class T>
inline void print(T x)
{
    if(x<0) x=~x+1,putchar('-');
    if(x>9) print(x/10);
    putchar(x%10+'0');
}

int a[200];
int vis[200];
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+1+n);
        memset(vis,0,sizeof vis);
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i]==cnt)
            {
                cout<<a[i]<<" ";
                vis[i]=1;
                cnt++;
            }
            else if(a[i]<cnt) continue;
            else break;
        }
        for(int i=1;i<=n;i++)
        {
            if(!vis[i]) cout<<a[i]<<" ";
        }
        cout<<endl;
    }
}

