#include <bits/stdc++.h>
using namespace std;
bool isPrime[1000005] = {false};
vector<long long int> SPF(1000005);
long long int fastPower(long long int a, long long int b) {
  if (b == 0) return 1;
  long long int prod = 1;
  while (b > 0) {
    if (b & 1) prod = prod * a;
    b = b >> 1;
    a = a * a;
  }
  return prod;
}
void sieve() {
  int i;
  for (i = 2; i < 1000005; ++i) isPrime[i] = 1;
  for (i = 2; i * i < 1000005; ++i) {
    if (isPrime[i]) {
      for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0;
    }
  }
}
void printa(bool f) {
  if (f)
    cout << "YES";
  else
    cout << "NO";
  cout << "\n";
}
bool flip(bool f) {
  if (f) return 0;
  return 1;
}
unordered_map<int, int> mp;
void solve() {
  int n, k, d, i;
  cin >> n >> k >> d;
  vector<int> a(n);
  for (i = 0; i < n; ++i) cin >> a[i];
  i = 0;
  while (i < d && i < n) {
    ++mp[a[i]];
    ++i;
  }
  if (i == n)
    cout << mp.size() << "\n";
  else {
    int ans = mp.size(), j;
    i = 1, j = i + d - 1;
    while (j < n) {
      if (mp[a[i - 1]] == 1)
        mp.erase(a[i - 1]);
      else
        --mp[a[i - 1]];
      ++mp[a[j]];
      int s = mp.size();
      ans = min(ans, s);
      ++i;
      ++j;
    }
    ans = min(ans, (int)mp.size());
    cout << ans << "\n";
  }
  mp.clear();
}
int main() {
  int tc = 1;
  scanf("%d", &tc);
  while (tc--) {
    solve();
  }
  return 0;
}
