#include<stdio.h>
const int N=5000001;
int x[N],d[N],v[N],n,dep,k,st=1,dr,i;
long long s;
inline void stanga(int i)
{
	if(i-d[st]==k)
		++st;
}
inline void dreapta(int i)
{
	while(st<=dr && v[d[dr]]+(long long)(i-d[dr])*dep >= v[i])
		dr--;
}
inline void adauga(int i)
{
	d[++dr]=i;
}
int main()
{
	freopen("branza.in","r",stdin);
	freopen("branza.out","w",stdout);
	scanf("%d%d%d",&n,&dep,&k);
	++k;
	for(i=1;i<=n;i++)
		scanf("%d%d",&v[i],&x[i]);
	for(i=1;i<=n;++i)
	{
		stanga(i);
		dreapta(i);
		adauga(i);
		s+=(long long)(v[d[st]]+(i-d[st])*dep)*x[i];
	}
	printf("%lld\n",s);
	return 0;
}