#include<cstdio>
#include<set>
#include<iostream>
#include<functional>
#include<algorithm>
using namespace std;
void quick_sort(int a[], int low, int high)
{
    if (low >= high)return;
    int s = low, e = high, key = a[low];
    while (s < e){
        while (s < e && a[e] >= key)e--;
        a[s] = a[e];
        while (s < e && a[s] <= key)s++;
        a[e] = a[s];
    }
    a[s] = key;
    quick_sort(a, low, s - 1);
    quick_sort(a, s + 1, high);
}
int main()
{
    int a[1006];
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;

        for (int i = 0; i < n; i++)
            cin >> a[i];
        quick_sort(a, 0, n - 1);
        for (int i = 0; i < n; i++){
            if (i == n - 1)cout << a[i] << endl;
            else cout << a[i] << " ";
        }

    }
    return 0;
}