#include <bits/stdc++.h>
using namespace std;
inline char gc() {
  static const long long L = 233333;
  static char sxd[L], *sss = sxd, *ttt = sxd;
  if (sss == ttt) {
    ttt = (sss = sxd) + fread(sxd, 1, L, stdin);
    if (sss == ttt) {
      return EOF;
    }
  }
  return *sss++;
}
inline char readalpha() {
  char c = gc();
  for (; !isalpha(c); c = gc())
    ;
  return c;
}
inline char readchar() {
  char c = gc();
  for (; c == ' '; c = gc())
    ;
  return c;
}
template <class T>
inline bool read(T& x) {
  bool flg = false;
  char c = gc();
  x = 0;
  for (; !isdigit(c); c = gc()) {
    if (c == '-') {
      flg = true;
    } else if (c == EOF) {
      return false;
    }
  }
  for (; isdigit(c); c = gc()) {
    x = (x << 1) + (x << 3) + (c ^ 48);
  }
  if (flg) {
    x = -x;
  }
  return true;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x < 10) {
    putchar(x | 48);
    return;
  }
  write(x / 10);
  putchar((x % 10) | 48);
}
template <class T>
inline void writesp(T x) {
  write(x);
  putchar(' ');
}
template <class T>
inline void writeln(T x) {
  write(x);
  puts("");
}
const int maxn = 1000005;
int T, n, k, d;
int tong[maxn];
int aa[maxn];
inline void solve() {
  read(n), read(k), read(d);
  for (int i = 1; i <= n; ++i) {
    read(aa[i]);
  }
  int kk = 0;
  int ans = n;
  int now = 1;
  for (int i = 1; i <= n - d + 1; ++i) {
    while (now < i + d) {
      if (!tong[aa[now]]) {
        kk++;
      }
      tong[aa[now]]++;
      ++now;
    }
    ans = min(ans, kk);
    tong[aa[i]]--;
    if (!tong[aa[i]]) {
      kk--;
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= n; ++i) {
    tong[aa[i]] = 0;
  }
}
int main() {
  read(T);
  while (T--) {
    solve();
  }
  return 0;
}
