#include <algorithm>
#include <iostream>
constexpr int N(510);
using ll=long long;
constexpr ll inf(1e18);
ll s,d,t,l[N],r[N],ed[N];int n;
ll calc(ll k)
{
	if(k<0) return 0;
	ll q=k/d;
	return std::min(k,std::min(t*q+k-d*q,t*(q+1)));
}
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cin>>s>>d>>t;
	std::cin>>n;++n;s+=d;
	for(int i(2);i<=n;++i) std::cin>>l[i]>>r[i],l[i]+=d,r[i]+=d;
	l[1]=0;r[1]=d;
	l[n+1]=s;r[n+1]=s+d;++n;r[n+1]=inf;l[n+1]=inf;ed[n+1]=inf;
	for(int i(1);i<=n;++i)
	{
		ed[i]=r[i]-d;
		if(ed[i]<=0)
		{
			ed[i]=0;
		}
		else
		{
			int t(0);
			while(l[t]<ed[i]) ++t;
			--t;ed[i]=std::max(r[t],ed[i]);
		}
	}
	static ll f[N];
	f[1]=calc(ed[1]);for(int i(2);i<=n;++i) f[i]=inf;
	for(int i(1);i<n;++i)
	{
		ll bs(0),pos(ed[i]);
		int idx(i+1);
		for(int j(i);j<n;++j)
		{
			if(pos<ed[j+1])
			{
				ll k((r[j]-pos-1)/d+1);
				pos+=(k-1)*d;pos=std::min(pos,l[j]);pos+=d;
				bs+=k*t;
				int t(j);while(r[t]<=pos) ++t;pos=std::min(l[t],pos);
			}
			while(ed[idx]<=l[j+1]) f[idx]=std::min(f[idx],calc(ed[idx]-pos)+f[i]+bs),++idx;
		}
	}
	std::cout<<f[n]-t<<std::endl;
	return 0;
}