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

using ll = int64_t;

ll N, M, T;
vector<ll> A;

void input() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> N >> M >> T;
    A.resize(M);
    for (ll i=0; i<M; ++i) {
        cin >> A[i];
        --A[i];
    }
}

vector<ll> CNT;

bool check(ll p) {
    ll over = 0;
    ll rem = 0;
    for (ll i=0; i<N; ++i) {
        if (CNT[i] > p) over += CNT[i] - p;
        else rem += (p - CNT[i]) / T;
    }
    return rem >= over;
}

ll binSearch() {
    ll ng = 0;
    ll ok = M;
    while (ok - ng > 1) {
        ll mid = (ng + ok) / 2;
        if (check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

void solve() {
    CNT.resize(N, 0);
    for (ll i=0; i<M; ++i) ++CNT[A[i]];
    ll ans = binSearch();
    cout << ans << "\n";
}

int main() {
    input();
    solve();
    return 0;
}