#include <bits/stdc++.h>
const int M = 1e9 + 7;
const int N = 1e6 + 5;
using namespace std;
long long int sum(0), k, n, m, x, y, z, t, i, j, ans(0), temp, mn(M), mx(-9e9);
void solve() {
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n, greater<long long int>());
  for (long long int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    solve();
  }
}
