There are N student in a line who are named from 1 to n. Aseer wants to pick out someone. He asks the students to count off from 1 to 2 firstly, and the students who count 2 weed out. Then he asks the students to count off from 1 to 3, and the students who count 3 weed out. Then Aseer repeats this proess: count off from 1 to 2 and then from 1 to 3 until there are no more than 3 students. Aseer wants to know these students' name.
The first line contains an integer T (0<T<=100), which is the number of test cases.
For each test case, there is an integer N(0<N<=100000), which is the number of the students.
One line -- the names of the rest of the students.