#include <bits/stdc++.h>
using namespace std;
unsigned long long power(unsigned long long x, long long int y,
                         long long int p) {
  unsigned long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
unsigned long long modInverse(unsigned long long n, long long int p) {
  return power(n, p - 2, p);
}
unsigned long long nCrModPFermat(unsigned long long n, long long int r,
                                 long long int p) {
  if (n < r) return 0;
  if (r == 0) return 1;
  unsigned long long fac[n + 1];
  fac[0] = 1;
  for (long long int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
long long int ncr(long long int n, long long int r) {
  long long int ans = 1;
  long long int x = 1;
  while (x <= r) {
    ans = ans * n / x;
    x++;
    n--;
  }
  return ans;
}
long long int fact(long long int n) {
  long long int ans = 1;
  while (n >= 1) {
    ans = ans * n;
    n--;
  }
  return ans;
}
vector<long long int> divisors(long long int n) {
  vector<long long int> ans;
  for (long long int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (n / i == i)
        ans.push_back(i);
      else {
        ans.push_back(i);
        ans.push_back(n / i);
      }
    }
  }
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    for (long long int i = 0; i < n; i++) {
      cout << 1 << " ";
    }
    cout << "\n";
  }
  return 0;
}
