#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 2000000000000000000



int main(){
	
	int n;
	cin>>n;
	
	long long D,T;
	cin>>D>>T;
	
	map<long long,vector<pair<long long,long long>>> mp;
	
	rep(i,n){
		long long X;
		cin>>X;
		long long Y = X;
		Y %= D;
		if(Y<0)Y += D;
		mp[Y].emplace_back(X - D * T, X + D * T);
	}
	long long ans = 0LL;
	for(auto a:mp){
		auto temp = a.second;
		sort(temp.begin(),temp.end());
		vector<pair<long long,long long>> t;
		rep(i,temp.size()){
			if(t.size()==0 || t.back().second < temp[i].first)t.push_back(temp[i]);
			else t.back().second = temp[i].second;
		}
		rep(i,t.size()){
			ans += (t[i].second - t[i].first)/D + 1;
		}
	}

	cout<<ans<<endl;
	
	return 0;
}