#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

/*================================*/

int N,D,T;
vector<int> X;

signed main()
{
    cin>>N>>D>>T;
    X.resize(N);
    
    map<int, vector<int> > P; // mod D ごと
    int x;
    REP(i,N) {
        cin >> X[i];
        x = X[i];
        if (X[i] < 0) {
            P[X[i]%D + D].push_back((X[i]-D+1)/D);
        } else {
            P[X[i]%D].push_back(X[i]/D);
        }
    }
    int ans = 0;
    for (auto &kv : P) {
        vector<int> p = kv.second;
        sort(ALL(p)); // 小さい順
        int maxj = p[0] - T * 2 - 3;
        for (int j : p) {
            int num = 1 + T * 2;
            int add = num - max(maxj - (j - T) + 1, 0LL);
            ans += add;
            maxj = max(maxj, j + T);
        }
    }
    
    cout << ans << endl;
    
    return 0;
}