Sorted Submission Times

You are given several test cases. In each test case, there are n competitors, each with a respective maximum time limit. Since all competitors start at time zero, every competitor will submit exactly at their maximum time limit. Your task is to sort these submission times and display them in increasing order.

More formally, for a test case with n competitors having submission times \(t_1, t_2, \ldots, t_n\), you need to output the sorted list \(s_1, s_2, \ldots, s_n\) where \(s_1 \le s_2 \le \cdots \le s_n\).

inputFormat

The first line contains an integer T, the number of test cases.

For each test case:

• The first line contains an integer n, the number of competitors.
• The second line contains n integers separated by spaces, representing the maximum time limits.

outputFormat

For each test case, output a single line containing the sorted submission times separated by a space.

## sample

1
3
5 3 8

3 5 8

</p>