#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <vector>
#include <set>

#define rep(x,to) for(int (x)=(0);(x)<(to);(x)++)

using namespace std;
typedef long long ll;


int main()
{
	
	ll N, D, T, res=0;
	cin >> N >> D >> T;
	vector<ll> X(N), am(N);
	rep(i,N) cin >> X[i], X[i]+=1000000000LL;
	
	sort(X.begin(), X.end());
	set<ll> st;
	rep(i,N){
		am[i]=X[i]%D;
		st.insert(am[i]);
	}
	
	for(auto no: st){
		ll oldmx=-1*1LL<<61;
		rep(i,N) if(no==am[i]){
			if(oldmx < X[i] -  D * T) res += 2*T+1;
			else res += (X[i] + D*T - oldmx +1)/ D;
			oldmx = X[i] + D*T;
			//printf("%lld:%lld:%lld, ",res,X[i],oldmx);
		}
	}		
			
	
	cout << res << endl;
	return 0;
}