#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;

    vector<int> nex(n);
    FOR(i,1,m+1){
        FOR(j,0,e[c[i]].size()-1){
            nex[e[c[i]][j]] = e[c[i]][j+1];
        }
    }
    int avail = k;
    // int l = 0;
    set<int> s;
    set<pair<int, int>> o;
    vector<int> active(m+1);
    int ans = 0;
    FOR(i,0,n){
        if (active[c[i]]) continue;
        else{
            ans++;
            if (avail == 0){
                int x;
                if (!s.empty()){
                    x = *s.begin();
                    s.erase(s.find(x));
                }else{
                    auto u = *o.begin();
                    x = u.second;    
                    o.erase(o.find(u));                
                }
                active[x] = 0;
                active[c[i]] = 1;
                if (pos[c[i]] == i) s.insert(c[i]);
                else o.insert({-nex[i], c[i]});
            }else{
                avail--;
                if (pos[c[i]] == i) s.insert(c[i]);
                else o.insert({-nex[i], c[i]});
                active[c[i]] = 1;
            }
        }
        // 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();
}