13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T61d,

A positive integer $$$x$$$ is a perfect root if there exists an integer $$$y$$$ such that $$$\sqrt{y} = x$$$. For example, $$$5$$$ is a perfect root because $$$\sqrt{25} = 5$$$.

For each test case, output $$$n$$$ distinct perfect roots. Note that the values only need to be distinct within each test case; you can use the same value in different test cases.

Input

The first line of the input contains a single integer $$$t$$$ ($$$1 \leq t \leq 20$$$) — the number of test cases.

The only line of each test case contains an integer $$$n$$$ ($$$1 \leq n \leq 20$$$) — the number of perfect roots to output.

Output

For each test case, output $$$n$$$ distinct perfect roots. Each perfect root $$$x$$$ must be in the range $$$1 \leq x \leq 10^9$$$.

Note

For the first test case:

$$$1$$$ is a perfect root because $$$\sqrt{1} = 1$$$.

Perfect Root

Examples