// includes
#include <cassert>
#include <cstdio>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

template <typename T>
struct MergableRangeSet{
  using PT = pair<T, T>;
  set<PT> st;
  MergableRangeSet(){}
  // [l, r)
  void add(T l, T r){
    st.insert(make_pair(l, r));
    merge();
  }
  void merge(){
    auto itr = st.begin();
    while(itr != st.end()){
      int l1 = itr->first;
      int r1 = itr->second;
      ++itr;
      if(itr == st.end())break;
      int l2 = itr->first;
      int r2 = itr->second;
      if(l2 <= r1){
        auto prev = itr;
        --prev;
        st.erase(itr);
        st.erase(prev);
        st.insert(make_pair(l1, r2));
        itr = st.lower_bound(make_pair(l1, r2));
      }
    }
  }
  auto begin() noexcept{
    return st.begin();
  }
  auto end() noexcept{
    return st.end();
  }
  size_t size(){
    return st.size();
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll d, t;
  cin >> n >> d >> t;
  vector<ll> x(n);
  rep(i, n)cin >> x[i];
  map<ll, MergableRangeSet<ll> > mp;
  rep(i, n){
    ll tmp = x[i] % d + d;
    tmp %= d;
    mp[tmp].add(-t * d + x[i], t * d + x[i] + 1);
  }
  ll res = 0;
  for(auto itr = mp.begin(); itr != mp.end(); ++itr){
    auto mrs = itr->second;
    for(auto i = mrs.begin(); i != mrs.end(); ++i){
      ll range = (i->second - i->first - 1);
      res += range / d + 1;
    }
  }
  cout << res << endl;
	return 0;
}