#include <bits/stdc++.h>
using namespace std;
long long max(long long i, long long j) { return i > j ? i : j; }
long long min(long long i, long long j) { return i < j ? i : j; }
int hcf(int a, int b) {
  if (b == 0) return a;
  return hcf(b, a % b);
}
int ncr(int n, int r) {
  if (r == 0) return 1;
  if (n == r) return 1;
  if (r == 1) return n;
  return ncr(n - 1, r) + ncr(n - 1, r - 1);
}
bool isPrime(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool sortValD(pair<int, int> a, pair<int, int> b) {
  return a.second > b.second;
}
vector<int> sieve(int n) {
  vector<bool> prime(n + 1, true);
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  vector<int> v;
  for (int i = 2; i < prime.size() + 2; i++) {
    if (prime[i]) v.push_back(i);
  }
  return v;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> v;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v.push_back(x);
    }
    sort(v.begin(), v.end(), greater<int>());
    for (int i = 0; i < n; i++) {
      cout << v[i] << " ";
    }
    cout << endl;
  }
}
