英语题目作业（19）

原题：

As Easy As A+B

 1000ms  32768K

描述：

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 32-int.

输出：

For each case, print the sorting result, and one line one case.

样例输入：

2
3 2 1 3
9 1 4 7 2 5 8 3 6 9

样例输出：

1 2 3
1 2 3 4 5 6 7 8 9

（链接：As Easy As A+B | JXNUOJ）

翻译：

和A+B一样简单

这些天，我在想一个问题，我怎么样才能做到和A+B一样简单的题呢？要做到这件事1是非常困难的。当然，在熬了n多天夜之后我做到了。

给你一些整数，你的任务是将这些数整理成升序。你现在应该知道它是如此的简单。

祝你好运！

输入：

输入包括多组测试样例。第一行输入一个整数T代表测试组数。接下来是T组测试数据。每组测试数据包括一个整数N（1<=N<1000,这些数字是排好序的），接下来是在同一行输入N个整数。保证所有整数不超过32位整数。

输出：

对于每组样例，输出排序后的结果，一行对应一组样例。