#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

vector<int> a;

int consistency(int n, int k, int d){

    int ans = k;

    unordered_map<int,int> mp;
    int s = 0, e = 0;
    while(e<n){
        mp[a[e]]++;
        if(e-s+1 < d){
            e++;
        }
        else{
            
            int size = mp.size();
            ans = min(ans, size);
            
            mp[a[s]]--;
            if(mp[a[s]] == 0) mp.erase(a[s]);
            s++;
            e++;
        }
    }



    return ans;
}












int practice(int n, int k, int d){

    return 0;
}

void solve() {
    
    int n, k, d;
    cin>>n >> k >> d;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, k, d) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}