Maximize Array Beauty

In this problem, you are given T test cases. In each test case, you will receive an integer N, followed by a list of N integers. Although the list of integers is provided, it does not affect the result. Your task is to maximize the beauty of the array by choosing the first N prime numbers from the list of all primes less than or equal to 100. The complete list of primes up to 100 is given by [ 2,;3,;5,;7,;11,;13,;17,;19,;23,;29,;31,;37,;41,;43,;47,;53,;59,;61,;67,;71,;73,;79,;83,;89,;97 ] For each test case, output the first N primes from this list as a space-separated sequence on one line.

inputFormat

The first line of input contains a single integer T, the number of test cases.

For each test case, the first line contains an integer N which specifies how many primes to output. The second line contains N integers (which are not used in the computation).

outputFormat

For each test case, output a single line containing the first N prime numbers (from the precomputed list of primes up to 100) separated by spaces.## sample

2
5
22 33 15 49 58
3
10 15 21

2 3 5 7 11
2 3 5