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

int N,M,T;

signed main(){
  cin>>N>>M>>T;
  vector<int> A(M);
  vector<int> cnt(N+1);
  for(int i = 0; i < M; i++) cin>>A[i];
  for(int i = 0; i < M; i++) cnt[A[i]]++;
  int ok = 1e18;
  int ng = -1;
  while(abs(ok - ng) > 1){
  	int mid = (ok + ng) / 2;
  	int ama = 0;
  	int ami = 0;
  	for(int i = 1; i <= N; i++){
  		ama += max((mid - cnt[i]) / T,0ll);
  		ami += max(cnt[i] - mid,0ll);
  	}
  	if(ama >= ami) ok = mid;
  	else ng = mid;
  }
  cout << ok << "\n";
}