Sorting algorithms are essentially necessary in computer science. If there are n numbers then the best time to sort the numbers is O(n log n). Here you are asked to write a code that will sort the numbers in ascending order using only if and else statements.

Constraints

1. Your code should contain a function named print() which prints the variables. There should be n parameters for print() and they are a, b, c, ...(ascending order). There should be a printf (as in C) function inside and should print all of them in ascending order. First three lines should describe the print() function. You can use spaces freely anywhere but the format inside printf should be correct. See the samples.
2. Your code should contain a function named sort(). The parameters should be same as the print() function. It should contain three kinds of statements:
   • if (x < y)
   • else
   • print(a, b, ...);
3. Every statement should be in a single line. And no line should be empty.
4. Nested if statements are allowed. And every if statement should have a corresponding else statement.
5. Assume that the judge will test your code with distinct integers. That means for any two given inputs x, y you can assume that x ≠ y.
6. For a code for n variables there should be exactly n! * 3 +3 lines (excluding the case).
7. Check the samples very carefully for formatting.

Input starts with an integer T (≤ 7), denoting the number of test cases.

Each case contains an integer n (1 ≤ n ≤ 7) denoting the numbers that will be given as input to your code.

For each case, print the case number in a line. Then you have to print your code. Check the samples for the formatting details. There can be multiple solutions, print any valid solution.