use std::collections::BTreeSet;

use proconio::{input, marker::Usize1};

fn main() {
    input! {
        n: usize, m: usize, t: i64,
        a: [Usize1; m],
    }

    let mut a_counts = vec![0i64; n];
    for &a in &a {
        a_counts[a] += 1;
    }
    a_counts.sort();

    let mut a_counts = a_counts.into_iter().map(|a| (a, a)).collect::<BTreeSet<_>>();
    let mut ans = a_counts.last().unwrap().0;
    loop {
        let min = *a_counts.first().unwrap();
        let max = *a_counts.last().unwrap();
        if max.1 == 0 {
            println!("{}", ans);
            break;
        } else {
            if min.0 + t <= ans {
                a_counts.pop_first();
                a_counts.insert((min.0 + t, min.0));
                a_counts.pop_last();
                a_counts.insert((max.0 - 1, max.1 - 1));
                ans = a_counts.last().unwrap().0;
            } else {
                println!("{}", ans);
                break;
            }
        }
    }
}