Little Gyro has just found an integer sequence in his right pocket. As Little Gyro is bored, he decides to sort the sequence.
Now given an integer sequence, and its size is no more than , please sort it within the ascending order.

输入描述:

There are multiple test cases. The first line of the input contains an integer T (1 ≤ T ≤ 10), indicating the number of test cases. For each test case:
The first line contains an integer n (1 ≤ n ≤ ), indicating the length of the sequence.
The second line contains n integers  (1 ≤  ≤ ), indicating the given sequence.

输出描述:

For each test case output the sequence after sorting.
Note: Please, DO NOT output extra spaces at the end of each line, or your answer may be considered incorrect!

2
5
1 4 8 3 7
6
10000 9999 9998 9997 9996 9995

1 3 4 7 8
9995 9996 9997 9998 9999 10000

This problem has huge input data, use scanf instead of cin to read data to avoid time limit exceed.

备注: