Easy
Beginners Problems > Ad-hoc

Tomal is learning programming recently. Being a curious computer science student, he is exploring many new programming techniques. As one of these, he has recently learnt sorting. But currently he only knows how to sort numbers.
Being too excited, he is checking on all his friends who can do the same. He is very friendly and helpful person, so he likes to share his knowledge. So he always makes all his friends do the same task that he has learnt recently and now he came to know that you know programming as well. So he wants to see whether you know how to sort numbers or not.
Input:
------
Input starts with an integer **T (≤ 30)**, denoting the number of test cases.
Each test case will start with a positive integer **C (≤ 1000)** on a separate line denoting the total numbers in this test case that you need to sort. Next line will contain **C** numbers separated by a space which you are going to sort. Be careful; don’t predict the numbers to be only positive integers. It can be any number like 0.55, -3.2, 0, 27, 9.99, -127 etc. But none of the fraction number will have more than 2 digits after the decimal point. So you do not need to worry about precision error. Also all numbers will be in the range **(-100000 >= N <= 100000)**.
Output:
-------
For each test case, print the sorted **C** numbers **(sorted in ascending order and in case of tie maintain order of input)** for each test case on a single line and each number separated by a comma. Be very careful that you have to print the number exactly as you take took the input; you can’t make any change even though the value is same. For example, if number in input was “01.50” then you can’t print it as “1.5”, you have to print it exactly “01.50” after the sort is done. Also if two values tie (15.00 & 15) then print in the order you took them input.
Sample Input
------------
4
6
0.55 -3.2 0 27 9.99 -127
1
0
2
1 -1
3
5 1.0 1
Sample Output
-------------
-127,-3.2,0,0.55,9.99,27
0
-1,1
1.0,1,5

#### Please login to submit solution to this problem.