#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec vector
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back 
#define eb emplace_back

using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
using mint = modint998244353;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};
// using Graph = vector<vector<pair<int,ll>>>;
using Graph = vector<vector<int>>;

int main(){
  // input
  int N,M,T;
  cin >> N >> M >> T;
  
  vector<int> A(M), B(N);
  rep(i,M){
    cin >> A[i];
    --A[i];
    B[A[i]]++;
  }
  
  // solve
  ll ok = (ll)M * T, ng = 0;
  while(abs(ok - ng) > 1){
    ll mid = (ok + ng) / 2;
    
    // vector<ll> times(N);
    ll other_bake = 0, can = 0;
    rep(i,N){
      ll times = max(mid - B[i], 0LL);
      can += times / T;
      if(B[i] > mid)
        other_bake += B[i] - mid;
    }

    if(other_bake <= can)
      ok = mid;
    else
      ng = mid;
  }
  // output
  cout << ok << endl;
}