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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, m, t;
    cin >> n >> m >> t;
    vector<int> tb(n);
    int v;
    for(int i = 0; i < m; i++){
        cin >> v;
        tb[v - 1]++;
    }
    int ng = -1, ok = m + 5;
    while(ng + 1 < ok){
        int mid = (ng + ok) / 2;
        int cnt = 0;
        ll rem = 0;
        for(int i = 0; i < n; i++){
            int d = min(mid, tb[i]);
            cnt += d;
            rem += (mid - d) / t;
        }
        (m - cnt <= rem ? ok : ng) = mid;
    }
    cout << ok << '\n';
}