#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } template T binarySearch(T ok, T ng, const F &f) { while (abs(ok - ng) > 1) { T mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, m, t; cin >> n >> m >> t; vectora(m), c(n); rep(i, m)cin >> a[i], a[i]--; rep(i, m)c[a[i]]++; auto f = [&](const long long x)->bool { int v0 = 0; long long v1 = 0; rep(i, n) { if (c[i] > x) v0 += c[i] - x; else { v1 += (x - c[i]) / t; } } return v1 >= v0; }; auto ans = binarySearch(INF, 0, f); cout << ans << endl; return 0; }