#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>

using namespace std;

int main() {
	int n;
	long long d, t;
	cin >> n >> d >> t;
	vector<long long> x(n);
	for (int i = 0; i < n; ++i) {
		cin >> x[i];
	}
	map<long long, set<long long> > positions;
	for (int i = 0; i < n; ++i) {
		positions[(0x80000000LL + x[i]) % d].insert(0x80000000LL + x[i]);
	}
	long long result = 0LL;
	for (map<long long, set<long long> >::const_iterator it = positions.begin();
		it != positions.end();
		++it) {
		vector<pair<long long, long long> > ranges;
		for (set<long long>::const_iterator itSet = it->second.begin();
			itSet != it->second.end();
			++itSet) {
			ranges.push_back(make_pair(*itSet / d - t, *itSet / d + t));
		}
		if (!ranges.empty()) {
			long long lower = ranges.front().first;
			long long upper = ranges.front().second;
			for (size_t i = 1; i < ranges.size(); ++i) {
				if (upper < ranges[i].first) {
					result += upper - lower + 1;
					lower = ranges[i].first;
				}
				upper = ranges[i].second;
			}
			result += upper - lower + 1;
		}
	}
	cout << result << endl;
	return 0;
}