#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vpll = vector<pll>;
using mll = map<long long, long long>;
using mcl = map<char, long long>;
using msl = map<string, long long>;
using sl = set<long long>;
using sc = set<char>;
using dl = deque<long long>;
const int N = 1e6 + 5;
long long mod = 1e9 + 7;
vl adj[N];
vpll adjc[N];
long long vis[N];
long long arr[N];
long long muld(long long a, long long b) {
  return (((a % mod) * (b % mod)) % mod);
}
long long sumd(long long a, long long b) {
  return (((a % mod) + (b % mod)) % mod);
}
long long subd(long long a, long long b) {
  return (((a % mod) - (b % mod) + mod) % mod);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long a, b, c, d, n, m, p, x, y, z, i, j, k,
      f = 0, tc, cnt = 0, sum = 0, mul = 1, mi = 1e18, ma = -1e18, cs;
  string str;
  char ch;
  double db;
  long long l, r;
  cin >> tc;
  for (cs = 1; cs <= tc; cs++) {
    cin >> n;
    for (i = 0; i < n; i++) cout << 1 << " ";
    cout << "\n";
  }
  return 0;
}
