#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}

void solve(){
    int n, m, k; cin >> n >> m >> k;



    vector<int> c(n);
    FOR(i,0,n) cin >> c[i];

    vector<int> pos(m+1);
    vector<vector<int>> e(m+1);
    FOR(i,0,n) e[c[i]].pb(i);
    FOR(i,0,n) pos[c[i]] = i;
    // cout << endl;
    vector<int> nex(n, 1e9);
    FOR(i,1,m+1){
        // printVector(e[i]);
        FOR(j,0,e[i].size()-1){
            nex[e[i][j]] = e[i][j+1];
        }
    }
    // cout << endl;
    int avail = k;
    // int l = 0;
    set<int> s;
    set<pair<int, int>> o;
    vector<int> active(m+1);
    int ans = 0;
    // nex[0] = 4;
    // printVector(nex);

    vector<int> prev(m+1, -1);
    FOR(i,0,n){
        if (active[c[i]]){
            int t = prev[c[i]];
            if (t > 1e6) continue;
            auto x = o.find({-t, c[i]});
            if (x == o.end()) continue;
            o.erase(x);
            o.insert({-(nex[i]), c[i]});
        }else{
            ans++;
            if (avail == 0){
                
                auto u = *o.begin();
                int x = u.second;    
                                
                
                o.erase(o.find(u));
                active[x] = 0;
                active[c[i]] = 1;
                o.insert({-nex[i], c[i]});
                prev[c[i]] = nex[i];
            }else{
                avail--;
                o.insert({-nex[i], c[i]});
                active[c[i]] = 1;
                prev[c[i]] = nex[i];
            }
        }
        // cout << i << ans << endl;
    }
    cout << ans << endl;
}


int32_t main(){
    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    ios::sync_with_stdio(false);cin.tie(nullptr);
    int t = 1; // cin >> t;
    while (t--) solve();
}