Jugnu has recently been appointed as the sports captain. The headmaster asked her to form a team for an upcoming table tennis tournament, subject to a few constraints.
Each student of the school is assigned an integer denoting his/her skill level. The headmaster requests Jugnu to form an indivisible team of size . The team is indivisible if it satisfies the following conditions.
- To make the team strong, each member of the team must have a skill level in the range .
- The size of the team must be .
- Let and be the skill levels of any two distinct players in the team. Then should not divide . This is necessary to avoid clashes.
Can you help Jugnu form an indivisible team? Assume that for every , Jugnu can always find a student with skill level .
Input Format
The first line contains a single integer , the number of test cases. The descriptions of test cases follow.
Each test case consists of a single line containing three space-separated integers , and .
Constraints
Output Format
For each test case, print a single line containing space-separated integers denoting the skill levels of the team members, or "" (without quotes) if it's impossible to build an indivisible team.
Make sure output of each testcase is followed by a new line.
You may output the elements in any order. Any valid solution will be accepted.
Sample Input 0
3
1 3 2
3 9 3
2 5 4
Sample Output 0
2 3
3 7 8
-1
Explanation 0
Test case 1: The list of skill levels is . Notice that neither divides nor divides .
Test case 2: There are multiple valid answers, e.g., , etc.
Test case 3: It is not possible to form an indivisible team.