#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        vector<int> v(k);
        for (auto &&j : v) scanf("%d", &j);
        sort(v.begin(),v.end(), greater<>());
        for (int j = 0; j < v.size(); ++j) {
            if(j) printf(" ");
            printf("%d", v[j]);
        }
        puts("");
    }
    return 0;
}