#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vp = vector<pair<int, int>>;

#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
#define sz(x) ((int)(x).size())
constexpr int INFI = 1001001001;
constexpr ll INFL = (1LL << 60);

ll n, m, t;
vl cnt;

ll binary_search() {
  ll ng = -1; 
  ll ok = t * m; 

  while (ok - ng > 1) {
    ll mid = ng + (ok - ng) / 2;
		// cerr <<"mid: "<< mid << "\n" ;
		ll yoyu = 0, amari = 0;
		rep (i, 0, n){
			if(mid >= cnt[i]){
				yoyu += (mid - cnt[i]) / t;
			}
			else{
				amari += cnt[i] - mid;
			}
			// cerr <<"cnt[i]: "<< cnt[i] << " yoyu: "<< yoyu << " amari: "<< amari << "\n" ;
		}
    if (yoyu >= amari) ok = mid;
    else ng = mid;
  }  
  return ok;
}

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

	// input
	cin >> n >> m >> t;
	cnt.resize (n);
	rep(i, 0, m){
		int a;
		cin >> a;
		cnt[a - 1] ++;
	}

	ll ok = binary_search();
	cout << ok << endl;
	
	return 0;
}