#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

int main(){
    int n,d,t;
    ll x,ans=0,X;
    pair<ll,pair<ll,ll> > p[100];
    
    scanf("%d%d%d",&n,&d,&t);
    
    for(int i=0;i<n;i++){
        scanf("%lld",&x);
        x+=1000000000LL;
        X=x/d;
        p[i] = {x%d,{X-t,X+t}};
    }
    
    sort(p,p+n);
    
    ll l=LLINF,r=-1;
    
    for(int i=0;i<n;i++){
        if(l==LLINF || p[i].second.second<l || r<p[i].second.first){
            ans+=max(0LL,r-l+1);
            l = p[i].second.first;
            r = p[i].second.second;
        }else{
            l=min(l,p[i].second.first);
            r=max(r,p[i].second.second);
        }
        
        if(i==n-1 || p[i].first!=p[i+1].first){
            ans+=r-l+1;
            l=LLINF;
            r=-1;
        }
        
    }
    
    cout << ans << endl;
    
    return 0;
}