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

    int ans = 0;
    vector<vector<int>> e(m+100);
    FOR(i,0,n) e[c[i]].pb(i);
    vector<int> nex(n+1, 1e9);
    FOR(i,1,m+1){
        if (e[i].size() == 0) continue;
        FOR(j,0,e[i].size()-1) nex[e[i][j]] = e[i][j+1];
    }
    vector<int> machine(k, -1);
    vector<int> active(m+100);
    vector<int> curr(m+100);
    FOR(i,0,n){
        // cout << i << ans << endl;
        if (active[c[i]]){
            curr[c[i]] = nex[i];
            continue;
        }
        ans++;
        int t = 0; int l = 0;
        bool done = false;
        FOR(j,0,k){
            if (machine[j] == -1){
                machine[j] = c[i];
                curr[c[i]] = nex[i];
                active[c[i]] = 1;
                done = true;
                break;
            }else{
                if (curr[machine[j]] > l){
                    l = max(l, curr[machine[j]]);
                    t = j;
                }
            }

        }
        if (done) continue;
        active[machine[t]] = 0;
        machine[t] = c[i];
        active[c[i]] = 1;
        curr[c[i]] = nex[i];
    }
    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();
}