#include <bits/stdc++.h>
using namespace std;
#define ll                      long long int
#define pb                      push_back
#define rep(i,a,b,c)            for(ll i=(a);i<=(b);i+=(c))
#define repb(i,a,b,c)           for(ll i=(a);i>=(b);i-=(c))
#define MOD                     1000000007
#define inf                     3e18
#define ld                      long double
//#define mp                      make_pair
#define vpll                    vector<pair<ll,ll>>
#define sll                     set<ll>
#define vll                     vector<ll>
#define vld                     vector<ld>
#define vvll                    vector<vector<ll>>
#define vvld                    vector<vector<ld>>
#define pll                     pair<ll,ll>
#define vvpll                   vector<vector<pair<ll,ll>>>
#define pqll                    priority_queue<ll>
#define mll                     map<ll,ll>
#define mlc                     map<ll,char>
#define um                      unordered_map
#define umll                    um<ll,ll>
#define umlc                    um<ll,char>
#define umcl                    um<char,ll>
#define all(x)                  x.begin(),x.end()
#define fi                      first
#define se                      second
#define ln                      cout<<"\n";
#define endl                    "\n"
#define test                    ll Testcases;cin>>Testcases;while(Testcases--)
#define isvowel(a)              (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define fastIO                  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define show(w,size)            {for(ll i=0;i<size;i++) cout<<w[i]<<" ";cout<<"\n";}
#define print(a)                cout<<a<<"\n";
#define mset(dp,no)             memset(dp,no,sizeof(dp))
#define input(a,n)              rep(i,0,n-1,1) cin>>a[i];
#define countbit                __builtin_popcount                                           //Number of setbits in decimal notation
#define lb(v,val)               lower_bound(all(v),val)-v.begin()
#define ub(v,val)               upper_bound(all(v),val)-v.begin()
#define SS                      stringstream
#define db(...)                 __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 <<'\n'; }
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
    const char* comma = strchr(names + 1, ',');
    cerr.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}

ll poww(ll b,ll e){if(e==0)return 1;else if(e%2==0){ll a=pow(b,e/2);return a*a;}else {ll a=pow(b,e/2);return b*a*a;}}
ll powm(ll x,ll y,ll m=MOD){x=x%m;ll res=1;while(y){if(y&1)res=res*x;res%=m;y=y>>1;x=x*x;x%=m;}return res;}
ll modInverse(ll a,ll m=MOD){if(m==1)return 0;ll m0=m,y=0,x=1;while(a>1){ll q=a/m,t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0) x+=m0;return x;}

struct SegmentTree
{
	ll n;
	vll v,lp;
	SegmentTree(ll size)
	{
		n=4*size+5;
		v.resize(n,0);
		lp.resize(n,0);
	}
	
	void update(ll l,ll r,ll val,ll ipos,ll fpos,ll pos=1)
	{
		if(ipos>fpos)
			return ;
		else if(l>r)
			return ;	
		else if(ipos>r)
			return ;
		else if(l>fpos)
			return ;		
		if((ipos==l)&&(r==fpos))
		{
			lp[pos]+=val;
		}
		else
		{
			v[pos]+=(val*(r-l+1));
			ll mid=(ipos+fpos)/2;
			update(l,min(mid,r),val,ipos,mid,pos*2);
			update(max(mid+1,l),r,val,mid+1,fpos,pos*2+1);
		}
	}

	ll get_sum(ll l,ll r,ll ipos,ll fpos,ll pos=1)
	{
		if(ipos>fpos)
			return 0;
		if(l>r)
			return 0;
		ll mid=(ipos+fpos)/2;
		if((l==ipos)&&(r==fpos))
		{
			v[pos]+=((r-l+1)*lp[pos]);
			if(pos*2<n)
				lp[pos*2]+=lp[pos];
			if((pos*2+1)<n)	
				lp[pos*2+1]+=lp[pos];
			lp[pos]=0;
			return v[pos];
		}
		else 
		{
			v[pos]+=((fpos-ipos+1)*lp[pos]);
			if(pos*2<n)
				lp[pos*2]+=lp[pos];
			if((pos*2+1)<n)
				lp[pos*2+1]+=lp[pos];
			lp[pos]=0;
			return get_sum(l,min(mid,r),ipos,mid,pos*2)+get_sum(max(mid+1,l),r,mid+1,fpos,pos*2+1);
		}
	}
};


int main()
{
	fastIO
	ll n,d,aa;
	cin>>n>>d>>aa;
	vpll a(n);
	rep(i,0,n-1,1)
		cin>>a[i].fi>>a[i].se;
	sort(all(a));
	vll x;
//	ll val[n];
//	mset(val,0);
	rep(i,0,n-1,1)
		x.pb(a[i].fi);
	SegmentTree st(n);
//	st.build(val,0,n-1);
	ll ans=0;
	rep(i,0,n-1,1)
	{
		ll vall=st.get_sum(i,i,0,n-1);
		a[i].se-=vall;
		if(a[i].se<=0)
			;
		else
		{
			ll pos=a[i].fi+d;
			pos+=d;
			ll val=(a[i].se+aa-1)/aa;
			ans+=val;
			val*=aa;
			ll rg=ub(x,pos);
			--rg;
			st.update(0,rg,val,0,n-1);
		}	
	}
	
	cout<<ans;
			
	return 0;
}




Measured memory_bytes: 17648