#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

int t, c[N];
int main() {
    cin >> n >> m >> t;
    for (int i = 1; i < m + 1; i++) scanf("%d", w + i), c[w[i]]++;
    ll l = 1, r = 1e18;
    while (l < r) {
        ll mid = l + r >> 1, v = 0;
        for (int i = 1; i < n + 1; i++) {
            if (c[i] <= mid) v += (mid - c[i]) / t;
            else v -= c[i] - mid;
        }
        if (v >= 0) r = mid;
        else l = mid + 1;
    }
    printf("%lld\n", l);
    return 0;
}