#include <bits/stdc++.h> // ver2.4.1
#include <complex.h>
//#include <boost/math/tools/minima.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vm vector<mint>
#define Vs vector<string>
#define Pii pair<int,int>
#define Pdd pair<double,double>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define INF 3000000000000000000  //  3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define PI 3.141592653589793238462
#define MOD 1000000007  //  10^9 + 7

using namespace std;
/* fmin(f,L,R,100) で関数の最小値を(x,min)で返す　*/
//using boost::math::tools::brent_find_minima;
/* cpp_int (任意の長さのint) */
//using boost::multiprecision::cpp_int;

/* デバッグ用 */
void Vout(auto a){if(a.size()==0) cout<<"."<<endl;
else{rep(i,0,a.size()-1)cout<<a[i]<<' ';if(a.size()>0)cout<<a.back()<<endl;}return;}
void Verr(auto a){if(a.size()==0) cerr<<"."<<endl;
else{rep(i,0,a.size()-1)cerr<<a[i]<<' ';if(a.size()>0)cerr<<a.back()<<endl;}return;}
void VVout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())Vout(a[i]);}return;}
void VVerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())Verr(a[i]);}return;}
void VPout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())cout<<a[i].FI<<' '<<a[i].SE<<endl;}return;}
void VPerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())cerr<<a[i].FI<<' '<<a[i].SE<<endl;}return;}

/* 便利関数 */
int gcd(int a,int b){return b?gcd(b,a%b):a;} // 最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;} // 最小公倍数lcm
int mypow(int x, int n, int m){ // 累乗x^n(mod m) O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){if((n-r)<r)r=n-r; // nCr(小さい場合)
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
int comb(int n, int r){if((n-r)<r)r=n-r; // nCr(%MOD)
int a=1;for(int i=n;i>n-r;--i){a=a*i%MOD;}for(int i=1;
i<r+1;++i){a=a*mypow(i,MOD-2,MOD)%MOD;}return a%MOD;}
Vi stpowV(){Vi a(100005);
a[0]=1;repeq(i,1,100004)a[i]=a[i-1]*i%MOD;return a;}
//Vi stpow = stpowV();  // 階乗配列(%MOD)
Vi Vsum(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}// 累積和
int digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';} // i桁目の数字
void press(auto &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
Vi zip(Vi b){int Z=b.size(); // 座標圧縮
Pii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)
p[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)
{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}
Vi beki2V(){Vi a(61);int q = 1;rep(i,0,61){a[i]=q;q*=2;}return a;}
Vi beki2 = beki2V(); // 2^n配列
int modiv(int a,int b){return a*mypow(b,MOD-2,MOD)%MOD;} // a÷b(MOD環境)

struct RAQ {
  
  
  
  vector<int> data;
  vector<int> bucket;
  int sq;
  
  RAQ(int n) {
    sq = sqrt(n);
    if(sq*sq==n) sq--;
    sq++;
    data = Vi(sq*sq,0); // 初期値はすべて0
    bucket = Vi(sq,-INF); // 無しのとき(-INF)
  }
  
  void radd(int L,int R,int k) { // [L,R]は範囲
    R++;
    int dL,dR;
    
    rep(i,0,sq+1) {
      dL = i*sq,dR = (i+1)*sq; // [dL,dR]は小範囲(バケット)
      
      if(dR <= L || R <= dL) continue; // バケットが完全に範囲外
      
      if(L <= dL && dR <= R) { // バケットが完全に範囲内
        if(bucket[i] == -INF) bucket[i] = k;
        else bucket[i] += k;
      }
      
      else { // バケットが範囲と一部重なる
        if(bucket[i]!=-INF){
          rep(j,dL,dR) data[j] += bucket[i];
          bucket[i] = -INF;
        }
        
        rep(j,max(L,dL),min(R,dR)) {
          data[j] += k;
        }
      }
    }
  }
  
  void add(int i,int k) {
    radd(i,i,k);
  }
  
  int at(int i) {
    int ib = i/sq;
    if(bucket[ib]==-INF) return data[i];
    else {
      int L = (i/sq)*sq,R = L+sq;
      rep(j,L,R) data[j] += bucket[ib];
      bucket[ib] = -INF;
      return data[i];
    }
  }
  
  void update(int i,int k) {
    int now = at(i);
    add(i,k-now);
  }
  
  void debug(){
    Verr(data);
    Verr(bucket);
  }
  
};

bool check(int k){  //  何らかの処理(例:ans以上ならtrue)
  
}
 
int binary(){
  int L = 0,R = 1000000010;  //  [L,R]の範囲内に解
  int mid = (L+R)/2;
  
  while(L<R){
    if(check(mid)) {
      R = mid;
    }
    else {
      L = mid+1;
    }
    mid = (L+R)/2;
  }
  
  return mid;
}
/*　使い方　*/
  
  /*
  
  RAQ myvec(n) // 宣言 nは必要な要素数 (以下すべて0-index)
  myvec.at(i) // 配列のi番目にアクセス
  myvec.update(i,k) // 配列のi番目をkにする
  myvec.add(i,k) // 配列のi番目にkを足す
  myvec.radd(L,R,k) // 配列のL番目からR番目にkを足す
  
  myvec.debug() // 元データ配列とバケット配列を標準エラー出力
  
  */
signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  int n,r,d;
  cin >> n >> r >> d;
  r *= 2;
  VPii mon(n);
  
  int qw,er;
  rep(i,0,n){
    cin >> qw >> er;
    mon[i] = mp(qw,er);
  }
  
  sort(ALL(mon));
  
  Vi x(n);
  RAQ hp(n+10);
  
  rep(i,0,n){
    x[i] = mon[i].FI;
    hp.add(i,mon[i].SE);
  }
  
  int ans = 0;
  
  rep(i,0,n){
    int nowh = hp.at(i);
    
    if(nowh <= 0) continue;
    
    int ct = dem(nowh,d);
    int nowx = x[i];
    int made = SMALLER(x,nowx+r)+COUNT(x,nowx+r);
    made--;
    ans += ct;
    
    hp.radd(i,made,(-1)*ct*d); // 配列のL番目からR番目にkを足す
  }
  
  cout << ans << endl;
  return 0;
}

Measured memory_bytes: 6528