#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N; cin >> N;
  while (N--) {
    int K; cin >> K;
    vector<int> L(K);
    for (int &i: L) cin >> i;
    sort(L.rbegin(), L.rend());
    for (int i = 0; i < K; i++) {
      cout << L[i] << (i + 1 == K? "\n": " ");
    }
  }
  return 0;
}