#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); ++i) using ll = long long; using ull = unsigned long long; int main() { cin.tie(nullptr)->sync_with_stdio(false); int n, m, t; cin >> n >> m >> t; vector a(m); rep(i, m) cin >> a[i], a[i]--; ll ok = 1e18, ng = 0; while (ok - ng > 1) { ll mid = (ok + ng) / 2; vector tm(n, 0); vector used(m, false); rep(i, m) { if (tm[a[i]] + 1 <= mid) tm[a[i]]++, used[i] = true; } { int idx = 0; rep(i, m) { if (used[i]) continue; while (idx < n && tm[idx] + t > mid) ++idx; if (idx == n) break; tm[idx] += t; used[i] = true; } } bool flg = true; rep(i, m) flg &= used[i]; (flg ? ok : ng) = mid; } cout << ok << '\n'; return 0; }