#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
namespace fastIO {
inline void input(int& res) {
  char c = getchar();
  res = 0;
  int f = 1;
  while (!isdigit(c)) {
    f ^= c == '-';
    c = getchar();
  }
  while (isdigit(c)) {
    res = (res << 3) + (res << 1) + (c ^ 48);
    c = getchar();
  }
  res = f ? res : -res;
}
inline long long qpow(long long a, long long b) {
  long long ans = 1, base = a;
  while (b) {
    if (b & 1) ans = (ans * base % mod + mod) % mod;
    base = (base * base % mod + mod) % mod;
    b >>= 1;
  }
  return ans;
}
}  // namespace fastIO
using namespace fastIO;
const int N = 1e6 + 5;
int Case, n;
int main() {
  Case = 1;
  input(Case);
  while (Case--) {
    input(n);
    for (int i = 1; i <= n; i++) printf("%d ", n);
    printf("\n");
  }
  return 0;
}
