#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
ll n,d,t;
vector<ll> x;
using P = pair<ll,ll>;

void solve(){
	map<ll,vector<P>> mp;
	sort(x.begin(),x.end());
	for(ll i = 0;i<n;i++){
		mp[(x[i]%d+d)%d].push_back(P(x[i],x[i]+1));
	}
	vector<vector<P>> vvp;
	for(auto &i:mp){
		vvp.push_back(i.second);
	}
	for(auto &i:vvp){
		for(auto &[l,r]:i){
			l -= d*t;
			r += d*t;
		}
	}
	for(auto &i:vvp){
		vector<P> add;
		for(auto &j:i){
			if(add.empty()){
				add.push_back(j);
			}else{
				//cout<<add.back().second<<' '<<j.first<<endl;
				if(add.back().second >= j.first){
					add.back().second = j.second;
				}else{
					add.push_back(j);
				}
			}
		}
		i = add;
	}
	ll ans = 0;
	for(auto &i:vvp){
		for(auto &[l,r]:i){
			ans += (r-l+d-1)/d;
		}
	}
	cout<<ans<<endl;

	
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> d >> t;
	x = vector<ll>(n);
	for(auto &i:x)cin >> i;
	solve();
}