#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (long long i = 0; i < static_cast<long long>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const long long INF = LONG_LONG_MAX / 2;
const double PI = 3.141592653589793238;
const long long MOD = 998244353;
bool many = true;
struct Solve {
  string endl = "\n";
  Solve() {
    long long n;
    cin >> n;
    vector<long long> a(n);
    for (long long& x : a) cin >> x;
    map<long long, vector<long long> > pos;
    for (long long i = 0; i < n; i++) {
      if ((long long)pos[a[i]].size() == 0) {
        pos[a[i]].push_back(-1);
      }
      pos[a[i]].push_back(i);
    }
    vector<long long> ans(n, -1);
    for (auto it : pos) {
      long long v = it.first;
      vector<long long> p = it.second;
      p.push_back(n);
      42;
      long long mxd = 0;
      for (long long i = 1; i < (long long)p.size(); i++) {
        mxd = max(mxd, p[i] - p[i - 1]);
      }
      42;
      for (long long x = mxd; x <= n; x++) {
        if (ans[x - 1] != -1) break;
        ans[x - 1] = v;
      }
    }
    for (long long x : ans) cout << x << ' ';
    cout << endl;
  }
};
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long CASES = 1;
  if (many) cin >> CASES;
  for (long long i = 1; i <= CASES; i++) {
    Solve me;
  }
}
