#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;

ll N, K, W, H, M, C, V;

const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

vector<double> cx, cy, c;
 ll MM = 1e12;

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

std::vector<int> Eratosthenes(int n ){
    std::vector<bool> is_prime( n + 1 );
    for( int i = 0; i <= n; i++ ) is_prime[ i ] = true;
    std::vector<int> P;
    for( int i = 2; i <= n; i++ ){
        if( is_prime[ i ] ){
            for( int j = 2 * i; j <= n; j += i ){
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

ll gcd(ll n, ll m){
    if(m == 0) return n;
    else return gcd(m, n%m);
}

vector<vector<ll>> dp(200, vector<ll> (200, 0));
vector<vector<pair<int, ll>>> cost(200); 


int main(){
    ll D, T, ans = 0;
    cin >> N >> D >> T;
    vector<ll> x(N);
    vector<bool> check(N, false);
    REP(i, N) cin >> x[i];
    sort(ALL(x));
    for(int i = 0; i < N; ++i){
        if(check[i]) continue;
        check[i] = true;
        ll left = x[i];
        ll right = x[i];
        for(int j = i + 1; j < N; ++j){
            if(  ( x[j]-  right )/D <= 2*T + 1 and ( x[j] - right ) % D == 0){
                check[j] = true;
                right = x[j];   
            }
        }
        ans += (right - left) / D  + 2*T + 1;
    }
    cout << ans << "\n";
    return 0;
}