#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;

const int INF = 2e9;
const ll LINF = 2e18;

#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; (i) < ((n) + 1); (i)++)
#define all(a) (a).begin(), (a).end()

const int dx[] = {-1,0,1,0};
const int dy[] = {0,1,0,-1};

int main(){
  ll N,M,T;
  cin>>N>>M>>T;
  vector<int> B(N,0);
  multiset<ll> S;
  rep(i,M){
    int A;
    cin>>A;
    A--;
    B[A]++;
  }

  rep(i,N){
    S.insert(B[i]);
  }

  while(true){
    auto itr1 = S.begin();
    auto itr2 = prev(S.end());
    if(*itr2 - 1 > *itr1 + T){
      ll a = *itr1 + T;
      ll b = *itr2 - 1;
      S.erase(itr1);
      S.erase(itr2);
      S.insert(a);
      S.insert(b);
    } else {
      break;
    }
  }
  cout<<*prev(S.end())<<endl;
}