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

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M; ll T;
    cin >> N >> M >> T;
    vector<int> cnt(N);
    for(int i = 0, a; i < M; i++) {
        cin >> a;
        cnt[a - 1]++;
    }

    ll ng = 0, ok = 3e14;
    while(ng + 1 < ok) {
        ll k = (ng + ok) / 2;
        ll p = 0, q = 0;
        for(int i = 0; i < N; i++) {
            if(cnt[i] <= k) p += (k - cnt[i]) / T;
            else q += cnt[i] - k;
        }
        (q <= p ? ok : ng) = k;
    }
    cout << ok << endl;
}