#include <bits/stdc++.h>
#include <atcoder/segtree>
using namespace std;
using ll=long long;
using P=pair<ll,int>;
P op(P x,P y){
	return min(x,y);
}
P e(){
	return make_pair(1e18,-1);
}
int main(){
	int n,m;
	ll t;
	cin>>n>>m>>t;
	vector<int> a(n);
	for(int i=0;i<m;i++){
		int tmp;
		cin>>tmp;
		tmp--;
		a[tmp]++;
	}
	atcoder::segtree<P,op,e> st(n);
	for(int i=0;i<n;i++)st.set(i,make_pair(a[i],i));
	priority_queue<P> pq;
	for(int i=0;i<n;i++)pq.push(make_pair(a[i],i));
	ll ans;
	while(1){
		auto[x,i]=pq.top();
		pq.pop();
		auto[y,j]=st.prod(0,n);
		if(y+t>=x-1){
			ans=x;
			break;
		}
		x--;
		y+=t;
		pq.push(make_pair(x,i));
		st.set(j,make_pair(y,j));
	}
	cout<<ans<<endl;
}