#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cassert>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;

int n, m, t;
int cnt[200000];

bool check(int X) {
    int i, tyoka = 0, stock = 0;

    rep(i, n) {
        if (cnt[i] > X) {
            tyoka += cnt[i] - X;
        }
        else {
            stock += (X - cnt[i]) / t;
        }
    }
    return tyoka <= stock;
}

signed main() {
    int i;

    cin >> n >> m >> t;
    rep(i, m) { int a; cin >> a; a--; cnt[a]++; }
    
    int ng = 0, ok = 1e+10, mid;
    while (ok - ng >= 2) {
        mid = (ng + ok) / 2;
        if (check(mid)) ok = mid;
        else ng = mid;
    }

    cout << ok << endl;
    return 0;
}