Easy as A+B
#描述#
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending.
You should know how easy the problem is now!
Good luck!
#格式#
##输入格式##
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32bit-int.
##输出格式##
For each case, print the sorting result, and one line one case.
#样例1#
##样例输入1##
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
##样例输出1##
1 2 3
1 2 3 4 5 6 7 8 9
#限制#
1000ms
32768KB
#提示#
#来源#
lcy