#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
using ll = long long;

int main(void){
  ll n, m, t; cin >> n >> m >> t;
  vector<ll> cnt(n);
  for(int i=0; i<m; i++){
    int a; cin >> a; a--;
    cnt[a]++;
  }
  ll left=0, right=1e9;
  while(right-left>1){
    ll mid=(left+right)/2;
    ll room=0, need=0;
    for(int i=0; i<n; i++){
      if(cnt[i]>=mid){
        need+=cnt[i]-mid;
      }
      else{
        ll p=mid-cnt[i];
        room+=p/t;
      }
    }
    if(need<=room) right=mid;
    else left=mid;
  }
  cout << right << endl;
  return 0;
}