#include <bits/stdc++.h>
using namespace std;
bool isprime(unsigned long long int n) {
  if (n == 1) {
    return false;
  }
  for (unsigned long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
vector<unsigned long long int> allprimebetween(unsigned long long int l,
                                               unsigned long long int r) {
  vector<bool> v(1000001, true);
  v[0] = v[1] = false;
  for (unsigned long long int i = 2; i * i <= 1000001; i++) {
    if (v[i]) {
      for (unsigned long long int j = i * i; j <= 1000001; j += i) {
        v[j] = false;
      }
    }
  }
  vector<unsigned long long int> prime;
  for (unsigned long long int i = l; i <= r; i++) {
    if (v[i]) {
      prime.push_back(i);
    }
  }
  return prime;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  unsigned long long int testcases;
  cin >> testcases;
  while (testcases--) {
    unsigned long long int n;
    cin >> n;
    for (unsigned long long int i = 0; i < n; i++) {
      cout << n << " ";
    }
    cout << '\n';
  }
  return 0;
}
