/* -*- coding: utf-8 -*-
 *
 * 1475.cc:  No.1475 時計の歯車Easy - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_K = 20;

/* typedef */

/* global variables */

int ls[MAX_K];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  while (n--) {
    int k;
    scanf("%d", &k);
    for (int i = 0; i < k; i++) scanf("%d", ls + i);
    sort(ls, ls + k, greater<int>());

    for (int i = 0; i < k; i++)
      printf("%d%c", ls[i], (i + 1 < k) ? ' ' : '\n');
  }
  return 0;
}