#include
#include
#include
int compare(const void *arg1, const void *arg2)
{
return (*(const int *)arg1 > *(const int *)arg2);
}
int main()
{
int i, j, T, N, loop, **data;
scanf("%d", &T);
data = (int **)malloc(sizeof(int *) * T);
loop = 0;
while (loop < T)
{
do
scanf("%d", &N);
while (N < 1 || N > 1000);
data[loop] = (int *)malloc(sizeof(int) * (N+1));
data[loop][0] = N;
for (i = 1; i <= N; ++i)
scanf("%d", &data[loop][i]);
++loop;
if (loop == T) break;
}
for (i = 0; i < T; ++i)
{
qsort(&data[i][1], data[i][0], sizeof(int), compare);
for (j = 1; j < data[i][0]; ++j)
printf("%d ", data[i][j]);
printf("%d\n", data[i][j]);
free(data[i]);
}
free(data);
return 0;
}