Dia wants to jump on N$N$ boxes, where boxes are named on numbers 2,3......$2,\mathrm{3......}$ and so on. Only the condition is, she should not jump to any other boxes whose number is not multiple of the previous boxes. Print the box names that she has jumped.

Input: - First line will contain T$T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two integers N$N$.

Output: For each testcase, output is printing name of boxes line by line

Constraints
- 1≤T≤1000$1\le T\le 1000$
- 1≤N≤105$1\le N\le {10}^5$