#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int MAX = INT_MAX;
void test_case() {
  int n;
  cin >> n;
  vector<int> arr(n), prev(n + 1, -1), sz(n + 1, -1), ans(n + 1);
  for (int &x : arr) cin >> x;
  for (int i = 0; i < n; i++) {
    sz[arr[i]] = max(sz[arr[i]], i - prev[arr[i]]);
    prev[arr[i]] = i;
  }
  for (int i = 0; i < n + 1; i++) {
    sz[i] = max(sz[i], n - prev[i]);
  }
  int pt = 0;
  for (int i = n; i > 0; i--) {
    while (pt < sz.size() && sz[pt] > i) pt += 1;
    ans[i] = pt != sz.size() ? pt : -1;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
  cout << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) test_case();
}
