Problem: Andre has very specific tastes. Recently he started falling in love with arrays.

Andre calls an nonempty array b good, if sum of its elements is divisible by the length of this array. For example, array [2, 3, 1] is good, as sum of its elements — 6 — is divisible by 3, but array [1, 1, 2, 3] isn't good, as 7 isn't divisible by 4. 

Andre calls an array a of length n perfect if the following conditions hold: 

  * Every nonempty subarray of this array is good. 
  * For every i (1 ≤ i ≤ n), 1 ≤ a_i ≤ 100. 



Given a positive integer n, output any perfect array of length n. We can show that for the given constraints such an array always exists.

An array c is a subarray of an array d if c can be obtained from d by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first and only line of every test case contains a single integer n (1 ≤ n ≤ 100).

Output

For every test, output any perfect array of length n on a separate line. 

Example

Input


3
1
2
4


Output


24
19 33
7 37 79 49

Note

Array [19, 33] is perfect as all 3 its subarrays: [19], [33], [19, 33], have sums divisible by their lengths, and therefore are good.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void swap(long long int &a, long long int &b) {
  a = a ^ b;
  b = a ^ b;
  a = a ^ b;
}
bool odd(long long int n) { return n & 1; }
long long int powerof2(long long int k) { return (1 << k); }
bool getbit(long long int n, long long int k) { return n & (1 << (k - 1)); }
void makesetbit(long long int &n, long long int &k) {
  int t = getbit(n, k);
  if (t)
    return;
  else
    n = n ^ (1 << (k - 1));
}
void makesetunbit(long long int &n, long long int k) {
  int t = getbit(n, k);
  if (t) n = n ^ (1 << (k - 1));
}
void sieve(set<long long int> &s, vector<bool> &arr) {
  for (int i = 4; i < 10000000001; i += 2) {
    arr[i] = false;
  }
  for (long long int i = 3; i * i < 10000000001; i += 2) {
    if (arr[i] == true) {
      for (long long int j = i * i; j <= 1000000001; j += i) arr[j] = false;
    }
  }
  s.insert(2);
  for (long long int i = 3; i * i < 1000000001; i += 2) {
    if (arr[i]) s.insert(i);
  }
}
bool o(int k, int b) {
  while (k > 0) {
    if (k % 10 == b) return true;
    k /= 10;
  }
  return false;
}
set<int> v;
void squares() {
  for (int i = 1; i < 101; i++) {
    v.insert(i * i);
  }
}
vector<long long int> vl;
vector<long long int> first(long long int *a, long long int s, long long int n,
                            long long int x) {
  static long long int index = 0;
  if (a[s] == x) vl.push_back(n - index);
  if (s == 0) return vl;
  index++;
  return first(a, s - 1, n, x);
}
int lengthofstring(string s, long long int start) {
  if (s[start] == '\0') return 0;
  return 1 + lengthofstring(s, start + 1);
}
void removeX(char s[]) {
  if (s[0] == '\0') return;
  if (s[0] != 'x')
    removeX(s + 1);
  else {
    long long int i;
    for (i = 1; s[i] != '\0'; ++i) {
      s[i - 1] = s[i];
    }
    s[i - 1] = s[i];
    removeX(s);
  }
}
void removedupli(char s[]) {
  if (s[0] == '\0' || s[1] == '\0') return;
  if (s[0] != s[1])
    removedupli(s + 1);
  else {
    long long int i;
    for (i = 1; s[i] != '\0'; ++i) {
      s[i - 1] = s[i];
    }
    s[i - 1] = s[i];
    removedupli(s);
  }
}
long long int fact(long long int a) {
  if (a == 0) return 1;
  return a * fact(a - 1);
}
int divide(long long int a, long long int b) {
  if (a < b) return 1;
  if (a == b) return 2;
  int ans = divide(a / b, b);
  int an = divide(a, b++);
  return 1 + min(an, ans);
}
long long int sumof(long long int a) {
  long long int sum = 0;
  while (a > 0) {
    sum += a % 10;
    a /= 10;
  }
  return sum;
}
bool compare(string a, string b) { return a.length() < b.length(); }
long long int med(vector<long long int> arr, long long int k) {
  sort(arr.begin(), arr.end(), greater<long long int>());
  if (k & 1) return arr[(k - 1) / 2];
  return arr[(k + 1) / 2];
}
bool compo(pair<int, int> arr, pair<int, int> brr) {
  if (arr.first == brr.first) {
    return arr.second < brr.second;
  }
  return arr.first > brr.first;
}
string binary(int n) {
  string s = "";
  while (n > 0) {
    s += to_string(n % 2);
    n /= 2;
  }
  return s;
}
int returnf(long long int a, int b) {
  int count = 0, m = b;
  while (a > b) {
    b *= m;
    count++;
  }
  return count;
}
bool pairs(pair<int, int> p1, pair<int, int> p2) {
  if (p1.first == p2.first) return p1.second < p2.second;
  return p1.first < p2.first;
}
int extended_gcd(long long int a, long long int b, long long int &x,
                 long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int x1, y1;
  long long int d = extended_gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return d;
}
bool check(string s) {
  string f = s;
  reverse(f.begin(), f.end());
  return f == s;
}
long long int solu(long long int n, long long int k) {
  if (k % n == 0) return k;
  return 1000000000000000000;
}
long long int sol(long long int n, long long int k) {
  cout << k << " ";
  if (k % n == 0) return k;
  long long int l = min(solu(n, k * 10), solu(n, k * 10 + 9));
  if (l != 1000000000000000000) return l;
  return min(l, min(sol(n, k * 10), sol(n, k * 10 + 9)));
}
bool isSubsetSum(vector<long long int> a, long long int n, long long int sum) {
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (long long int i = 1; i <= sum; i++) subset[0][i] = false;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = 1; j <= sum; j++) {
      if (j < a[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= a[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - a[i - 1]];
    }
  }
  return subset[n][sum];
}
bool isequal(string a, string b) {
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  return a == b;
}
long long int pri(long long int m) {
  if (m == 1) return 0;
  return 1 + pri(m / 2);
}
long long int fibo(long long int n) {
  if (n == 1) return 0;
  if (n == 2) return 1;
  return fibo(n - 1) + fibo(n - 2);
}
void solve() {
  long long int n;
  cin >> n;
  for (int i = 0; i < n; i++) cout << "4 ";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}