#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <fstream>
#include <sstream>
using namespace std;
typedef long long ll;

ll Xs[110];
map<ll, vector< pair<ll, ll> > > intervals;

int main(){
    ll N, D, T;
    cin >> N >> D >> T;
    
    for(int i=0;i<N;i++)cin >> Xs[i];
    sort(Xs, Xs + N);
    
    for(int i=0;i<N;i++){
        ll X = Xs[i];
        
        ll mod = (X % D + D) % D;
        intervals[mod].push_back(make_pair(X - D * T, X + D * T));
    }
    
    ll res = 0;
    
    map<ll, vector< pair<ll, ll> > >::iterator itr;
    for(itr = intervals.begin(); itr != intervals.end(); itr++){
        vector< pair<ll, ll> > vs = itr->second;
        
        ll p = -1ll<<60;
        ll sum = 0;
        
        for(int i=0;i<vs.size();i++){
            ll s = vs[i].first, t = vs[i].second;
            
            if(t <= p){
            } else if(s <= p){
                sum += t - p;
                p = t;
            } else {
                res += sum / D + 1;
                
                p = t;
                sum = p - s;
            }
        }
        
        res += sum / D + 1;
        res--;
    }
    
    cout << res << endl;
    
    
    return 0;
}