#include<stdlib.h>
#include<stdio.h>
int u,h;
typedef struct{
		int height;
		int weight;
		}pom;
int compare(const void * a, const void * b){
	pom * a1 = (pom*)a;
	pom * a2 = (pom*)b;
	int ind1 = (h - a1->height)/u;
	int ind2 = (h - a2->height)/u;
	if (ind1 == ind2)
	  return a2->weight - a1->weight;
	else
	  return a2->height - a1->height;
}

// functia pentru interclasarea solutiilor
void minweight(int a[],int b[],int n1,int n2,int limit){
    int i = 0,j = 0,l = 0;
    int c[n1 + n2]; 				// vectorul pentru interclasare
    
    while ((j<n1)&&(i<n2)){
      if ((a[j]>b[i]) && (a[j]!=0)) c[l++] = a[j++];
      else 
	c[l++] = b[i++];
    }
    
    for (;j<n1;j++)
      c[l++] = a[j];
    for (;i<n2;i++)
      c[l++] = b[i];
    l--;  
  
    for (i = 0; i<n1-limit; i++)
    	a[i] = c[i];
    for(;i<n1; i++)
    	a[i] = 0;	
    	
}

int main(int argc, char * argv[]){
	int n,aux1,ind1,ind2,k,l;
	int i,j,x,lung;
	unsigned int sum;
	
	FILE * fis = fopen("gutui.in","r");
	if (fis == NULL) printf("Couldn't open file\n");
	FILE * out = fopen("gutui.out","w");

	fscanf(fis,"%d",&n);
	fscanf(fis,"%d",&h);
	fscanf(fis,"%d",&u);
	
	pom * v = (pom*)malloc(n*sizeof(pom));
	int aux[n];
	int fin[n];
	
	for (i = 0; i<n; i++){
		fscanf(fis,"%d %d",&v[i].height,&v[i].weight);
		}
	/*	
	int ord ;	
	do 	{
		ord  = 0;
		for (i = 0; i<n-1; i++){
			//if ((h - v[i].height)%u == 0) ind1 = (h - v[i].height)/u-1;
			//else
			 ind1 = (h - v[i].height)/u;
			//if ((h - v[i+1].height)%u == 0)ind2 = (h - v[i+1].height)/u-1;
			//else
			 ind2 =( h - v[i+1].height)/u;
			
			if (ind1 > ind2 ){
			
			   				 aux1 = v[i+1].height;
							 aux2 = v[i+1].weight;
							 v[i+1].height = v[i].height;
							 v[i+1].weight = v[i].weight;
							 v[i].height = aux1;
							 v[i].weight = aux2;
							 ord  = 1;
							 }
		 else if ((ind1 == ind2)&&(v[i].weight < v[i+1].weight)) {
		 	  				aux1 = v[i+1].height;
							 aux2 = v[i+1].weight;
							 v[i+1].height = v[i].height;
							 v[i+1].weight = v[i].weight;
							 v[i].height = aux1;
							 v[i].weight = aux2;
							 ord  = 1;
		 	  }
							 
		}			   
	}while (ord == 1);
	*/
	
	qsort(v,n,sizeof(pom),compare);
	
	//for (i = 0; i<n; i++)
	//	printf("%d %d\n",v[i].height,v[i].weight);
	
		
	for (i = 0; i<n; i++){			// initializarea vectorului de solutii finale
		fin[i] = 0;
	}
	
    	lung = 0;
    	aux1 = 0;
    	
    	
	for (i = 0; i<n; i++){
		ind1 = (h - v[i].height)/u;			// indicele nivelui curent
		k =  ind1 + 1;					// nr maxim de gutui ce se pot lua de pe un nivel
		ind2 =  ind1;
		j = i;
		
		aux1 = 0;					// nr de gutui de gutui ce se iau de pe un nivel
		l = 0;						// nr de gutui ce se elimina de pe un nivel superior
		x = lung;					// rata de crestere a pomului
		while (ind2 == ind1){				// parcurgerea unui nivel in cautarea gutuilor ce pot alcatui o solutie optima 
			if (k>0){
				if (v[j].height + u * (x+aux1) > h){
					if ((v[j].weight > fin[lung-l-1]) && (fin[lung - l-1]!=0)){
					  l++;			// elimarea 
					  aux[aux1++] = v[j].weight;
					  x--;
					}
				}
				else aux[aux1++] = v[j].weight;
			k--;	
			}
			
			j++;
			if (j == n) break;
			ind2 = (h - v[j].height)/u;
			
		}
		
		lung = lung + aux1;				// actulizarea lungimii 
		minweight(fin,aux,lung,aux1,l);			// interclasarea solutiilor finale cu cele optime de un nivel
		lung = lung - l;
		i = j -1;	   				
	}
	
	sum = 0;				// greutatea maxima 
	
	for (i = 0; i<lung; i++)
		sum = sum +fin[i];
	
	fprintf(out,"%d",sum);
	
	fclose(out);
	fclose(fis);
	return 0;
	
}