#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int maxn = 100;
long long bin(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
int gcd(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
long long fact(long long x) {
  long long res = 1;
  for (long long i = 1; i <= x; i++) res = (res * i) % mod;
  return res;
}
long long bcof(long long x, long long y) {
  return fact(x) * bin(fact(x - y) * fact(y) % mod, mod - 2) % mod;
}
vector<vector<long long> > adj;
vector<bool> vis(maxn);
vector<long long> comp;
void dfs(int v) {
  vis[v] = true;
  comp.push_back(v);
  for (int u : adj[v])
    if (!vis[u]) dfs(u);
}
void solve(long long n, long long &ans, long long &p) {
  for (int i = 1; i <= n; i++) vis[i] = false;
  for (long long i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i);
      comp.clear();
      ans++;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t, n, m, i, j, k;
  cin >> t;
  while (t--) {
    cin >> n;
    int a[n];
    for (i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n, greater<int>());
    for (i = 0; i < n; i++) cout << a[i] << " ";
    cout << "\n";
  }
}
