#include <bits/stdc++.h>
using namespace std;
vector<long long> bitsrev(vector<long long> arr, long long x) {
  while (x > 0) {
    arr.push_back(x % 2);
    x /= 2;
  }
  return arr;
}
void equateLen(vector<long long> &el, vector<long long> &ar) {
  if (el.size() != ar.size()) {
    if (el.size() < ar.size()) {
      while (el.size() != ar.size()) {
        el.push_back(0);
      }
    } else {
      while (el.size() != ar.size()) {
        ar.push_back(0);
      }
    }
  }
}
long long search(vector<long long> arr, long long l, long long r, long long x) {
  if (r >= l) {
    long long mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return search(arr, l, mid - 1, x);
    return search(arr, mid + 1, r, x);
  }
  return -1;
}
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long n, long long p) { return power(n, p - 2, p); }
long long CmP(long long n, long long r, long long p = 1000000007) {
  if (r == 0) return 1;
  long long fac[n + 1];
  fac[0] = 1;
  for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
long long ask1(long long y) {
  cout << 1 << " " << y << endl;
  long long x;
  cin >> x;
  return x;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  long long cccc = t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> in(n);
    for (long long i = 0; i <= n - 1; i++) {
      cin >> in[i];
    }
    sort(in.begin(), in.end());
    reverse(in.begin(), in.end());
    for (long long i = 0; i <= n - 1; i++) {
      cout << in[i] << " ";
    };
    cout << ""
         << "\n";
  }
}
