Find the Permutation

In this problem, you are given a permutation of integers from 1 to (n). A permutation is an arrangement of the numbers (1, 2, \ldots, n) in some order with each number appearing exactly once. Although the original challenge allowed you to query at most (2n) positions to determine the permutation, in this simplified version the permutation is provided directly via standard input. Your task is to simply output the given permutation.

Note: The input may contain multiple test cases. For each test case, output the permutation on a single line, preserving the order as given in the input.

inputFormat

The first line of input contains an integer (T) ((1 \le T\le 100)), the number of test cases. Each test case consists of two lines. The first line of each test case contains an integer (n) ((1 \le n \le 10^5)), representing the length of the permutation. The second line contains (n) space-separated integers denoting the permutation.

outputFormat

For each test case, output a single line with (n) space-separated integers representing the permutation exactly as provided in the input.## sample

4
2 1 4 3

2 1 4 3