/**
	author:  shobonvip
	created: 2025.10.29 12:15:52
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, t;
	cin >> n >> m >> t;
	vector<ll> a(m);
	vector<ll> c(n);
	rep(i,0,m) {
		cin >> a[i];
		a[i]--;
		c[a[i]]++;
	} 

	auto check = [&](ll v) -> bool {
		ll left = 0;
		vector<ll> d(n, v);
		rep(i,0,n) {
			ll targ = min(d[i], c[i]);
			d[i] -= targ;
			left += c[i] - targ;
		}
		rep(i,0,n) {
			ll targ = min(d[i] / t, left);
			left -= targ;
		}

		if (left == 0) {
			return true;
		}

		return false;
	};

	ll ub = 1e16; // ok
	ll lb = 0; // ng
	while (ub - lb > 1) {
		ll t = (ub + lb) / 2;
		if (check(t)) ub = t;
		else lb = t;
	}

	cout << ub << '\n';

}