#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int N, M;
	ll T;
	cin >> N >> M >> T;
	vector<int> A(M);
	rep(i, 0, M) {
		cin >> A[i];
		--A[i];
	}
	
	ll ng = 0, ok = 1l << 60;
	while (ok - ng > 1) {
		ll mid = (ok - ng) / 2 + ng;
		
		vector<ll> cnt(N);
		ll rest = 0;
		rep(i, 0, M) {
			if (cnt[A[i]] < mid) ++cnt[A[i]];
			else ++rest;
		}
		
		ll can = 0;
		rep(i, 0, N) can += (mid - cnt[i]) / T;
		
		if (rest <= can) ok = mid;
		else ng = mid;
	}
	cout << ok << '\n';
}