#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
int n, m, t, cnt[2 << 17];
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> t;
  rep(i, m) {
    int a;
    cin >> a;
    --a;
    ++cnt[a];
  }
  int lo = 1, hi = 2 << 17;
  while (lo < hi) {
    int mid = (lo + hi) / 2, sum = 0;
    rep(i, n) {
      sum += min(mid, cnt[i]) + max(0, mid - cnt[i]) / t;
      if (m <= sum) break;
    }
    if (m <= sum)
      hi = mid;
    else
      lo = mid + 1;
  }
  cout << lo << endl;
}