1372A. Omkar and Completion

A. Omkar and Completion

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have been blessed as a child of Omkar. To express your gratitude, please solve this problem for Omkar!

An array aa of length nn is called complete if all elements are positive and don't exceed 10001000, and for all indices xx,yy,zz (1≤x,y,z≤n1≤x,y,z≤n), ax+ay≠azax+ay≠az (not necessarily distinct).

You are given one integer nn. Please find any complete array of length nn. It is guaranteed that under given constraints such array exists.

Input

Each test contains multiple test cases. The first line contains tt (1≤t≤10001≤t≤1000)  — the number of test cases. Description of the test cases follows.

The only line of each test case contains one integer nn (1≤n≤10001≤n≤1000).

It is guaranteed that the sum of nn over all test cases does not exceed 10001000.

Output

For each test case, print a complete array on a single line. All elements have to be integers between 11 and 10001000 and for all indices xx,yy,zz (1≤x,y,z≤n1≤x,y,z≤n) (not necessarily distinct), ax+ay≠azax+ay≠az must hold.

If multiple solutions exist, you may print any.

Example

input

Copy

2
5
4

output

Copy

1 5 3 77 12
384 384 44 44

Note

It can be shown that the outputs above are valid for each test case. For example, 44+44≠38444+44≠384.

Below are some examples of arrays that are NOT complete for the 1st test case:

[1,2,3,4,5][1,2,3,4,5]

Notice that a1+a2=a3a1+a2=a3.

[1,3000,1,300,1][1,3000,1,300,1]

Notice that a2=3000>1000a2=3000>1000.

偶然遇见的水题，由于解题方法过于让我惊吓，特意水一篇博客。

读完题不难发现输出1就行了。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int manx = 2e6 + 10;
long long a[manx];
long long b[manx];
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			cout << 1 << " ";
		}
		cout << endl;
	}
}