#include<stdio.h>
#define nmax 100010
long h[nmax], t[nmax], d[nmax], ln[nmax], n, x, l, nh, tmax, nr;
FILE *f, *g;

void ins(long lana)
{	long k, z;
	h[++nh]=lana;
	k=nh;
	while(h[k/2]<h[k] && k>1)
	{       z=h[k]; h[k]=h[k/2]; h[k/2]=z;
		k=k/2;
	}
}

void del(long k)
{	long z, m;
	z=h[k]; h[k]=h[nh]; h[nh]=z;
	nh--;
	while(( (h[2*k]>h[k] && 2*k<=nh) ||
		(h[2*k+1]>h[k] && 2*k+1<=nh) )	&& k<nh)
	{       if(2*k==nh)			m=2*k;
		else	if(h[2*k]>h[2*k+1])	m=2*k;
			else			m=2*k+1;
		z=h[m]; h[m]=h[k]; h[k]=z;
		k=m;
	}
}


int main()
{       long i, j;
	f=fopen("lupu.in", "r");
	g=fopen("lupu.out", "w");
	fscanf(f, "%ld%ld%ld", &n, &x, &l);
	for(i=1; i<=n; i++)
	{	fscanf(f, "%ld%ld", &d[i], &ln[i]);
		if(x-d[i]>=0)
		{	t[i]=(x-d[i])/l+1;
			if(t[i]>tmax)
				tmax=t[i];
		}
	}
	for(j=tmax; j>=1; j--)
	{       for(i=1; i<=n; i++)
			if(t[i]==j)
				ins(ln[i]);
		if(nh>0)
		{	nr+=h[1];
			del(1);
		}
	}
	fprintf(g, "%ld\n", nr);
	fclose(g);
	return 0;
}