#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long arr[N], A[N], ARR[N];
bool visited[N] = {};
long long cnt[N] = {};
bool f, ff;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n && cin >> arr[i]; ++i)
      ;
    if (n == 1) {
      cout << arr[0] << endl;
      continue;
    }
    sort(arr, arr + n);
    for (int i = n - 1; i >= 0; i--) {
      cout << arr[i] << ' ';
    }
    cout << endl;
  }
  return 0;
}
