#include <bits/stdc++.h>
#include <atcoder/all>
#include <iostream>
#include <cmath>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
using WGraph = vector<vector<pair<ll, ll>>>;
using mint = modint998244353;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
mt19937_64 rng(58);
long double PI = 3.14159265358979;
const ll LLMAX = 9223372036854775807;
const ll INF = 1e18;
vector<ll> di = {1, 0, -1, 0};
vector<ll> dj = {0, -1, 0, 1};
void chmin(ll& x, ll y) { x = min(x, y);};
void chmax(ll& x, ll y) { x = max(x, y);};

int main() {
    ll n, m, t;
    cin >> n >> m >> t;
    vector<ll> a(m);
    rep (i, m) {
        cin >> a[i];
        a[i]--;
    }

    ll ok = 1e15;
    ll ng = 0;
    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;
        auto f = [&](ll x) {
            vector<ll> ov(n, 0);
            ll cnt = 0;
            rep (i, m) {
                ll rest = x - ov[a[i]];
                if (rest > 0) ov[a[i]]++;
                else cnt++;
            }
            rep (i, n) {
                ll rest = x - ov[i];
                cnt -= rest / t; 
                if (cnt < 0) break;
            }
            return cnt <= 0;
        };
        if (f(mid)) ok = mid;
        else ng = mid;
    }

    cout << ok << endl;
    return 0;
}