#include <stdlib.h>
#include <stdio.h>


typedef struct{
	int h;
	int g;
}gutuie;


int compare(const void *a,const void *b){
	gutuie * first=(gutuie *) a;
	gutuie * second=(gutuie *) b;
	return (second->g - first->g);
}
void Sort_Shell (gutuie v[], int dim){
	int i, pas, inv;
	gutuie a;
	pas = dim;
	while (pas >1 )
		{
		pas=pas/2 ;	
		do
			{
			inv=0 ; 			
			for (i=0; i < dim-pas; i++)
				{			
				if (v[i].g < v[i+pas].g)		//sortare descresactoare a greutatilor gutuilor
					{
					a=v[i+pas];
					v[i+pas]=v[i];
					v[i]=a;
					inv=1;		
				
					}
				}
			} while (inv);
		}
}


int main(){
gutuie sir[100000];
int i;
FILE *fp=fopen("gutui.in","r");
FILE *fp1=fopen("gutui.out","w");
char s[80];
fgets(s,80,fp);

char *sep=" ";
int N=atoi(strtok (s,sep));

int H=atoi(strtok (0,sep));

int U=atoi(strtok (0,sep));

int n=0;
int * a= (int*) calloc (H/U+2, sizeof(int) );

while ( fgets(s,80,fp) != NULL ){
	sir[n].h=atoi(strtok (s,sep));
	sir[n].g=atoi(strtok (0,sep));
	
	n++;
}//end while

fclose (fp);
int g=0;
//qsort(sir,N,sizeof(gutuie),compare);
Sort_Shell(sir,N);
int max=0;

for( i=0; i<N;i++){
	//printf("%d %d\n", sir[i].h, sir[i].g);
	n=(H-sir[i].h)/U+1;
	 
	while ((a[n]!=0) && (n>0))
		n--;
	if (n>max) max=n;
	//printf("%d   ",n);
	if (n>=0) //{
		a[n]=sir[i].g;
		//printf("bau\n");}
	else 
		 break;
	
			
}

for (i=1; i<=max+1; i++){
	//printf("%d %d %d\n", a[i], sir[i-1].g, sir[i-1].h);
	if (a[i]!=0)
		g=g+a[i];
	
	
}

	
//printf("%d\n",g);
fprintf(fp1,"%d",g);
fclose(fp1);
}