#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define FAST ios_base::sync_with_stdio(false); cin.tie(nullptr);

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

// Debug helper (works only in local environment)
#ifdef DEBUG
#define debug(x) cerr << #x << " = " << (x) << "\n"
#else
#define debug(x)
#endif

int main() {
    FAST;
    
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int> arr(n);
        for(auto &x : arr) cin >> x;
        
        sort(all(arr));
        for(auto x : arr)
            cout << x << " ";
        cout << "\n";
    }
    
    return 0;
}

// Fast I/O for large inputs
ios::sync_with_stdio(false);
cin.tie(nullptr);

// Vector initialization shortcuts
vector<int> dp(n, -1);           // Initialize with -1
vector<vector<int>> grid(n, vector<int>(m, 0)); // 2D grid

// STL shortcuts
sort(all(v));                    // Sort entire vector
reverse(all(v));                 // Reverse vector
v.erase(unique(all(v)), v.end()); // Remove duplicates

// Common patterns
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

// Two Pointers Template
int left = 0, right = n - 1;
while (left < right) {
    if (condition) left++;
    else right--;
}

// Sliding Window Template
int left = 0, right = 0;
while (right < n) {
    // Expand window
    while (invalid_condition) {
        // Shrink window
        left++;
    }
    // Update answer
    right++;
}

// Binary Search Template
int left = 0, right = n;
while (left < right) {
    int mid = left + (right - left) / 2;
    if (check(mid)) right = mid;
    else left = mid + 1;
}

// n <= 10^8:   O(log n), O(1)
// n <= 10^6:   O(n), O(n log n)
// n <= 10^4:   O(n²)
// n <= 500:    O(n³)
// n <= 20:     O(2^n), O(n!)
// n <= 10:     O(n!)