/*BUCHIR Elena
     325CC*/

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

typedef struct{
        long int h,g;
        int pas;
        }gutuie;

int minim(int a, int b){
    if(a<b) return a;
    else return b;
}
//functie care compara doua gutui dupa inaltime
int compara_gutuie(const void *a, const void *b)
{
	gutuie * h1 = (gutuie*) a;
	gutuie * h2 = (gutuie*) b;
	return h2 -> h - h1 -> h;
	return 0;
}

int main(){
    FILE* f=fopen("gutui.in","r");
    FILE* p=fopen("gutui.out","w"); 
    long int N, H, U;
    int ridic=1,min;//in ridic am retinut de cate ori se poate inalta, maxim, gutuiul, pana in momentul prezent
    int i,j; 
    fscanf(f,"%ld %ld %ld",&N,&H,&U); 
    gutuie x[100000];
    int sol[100000]; // greutatea maxima care se poate obtine 
    int max=x[0].g;
    sol[1]=x[0].g;
    for(i=0;i<N;i++){                                                                                                                                                                                                                                                  
                     fscanf(f,"%ld %ld",&x[i].h,&x[i].g);}
                      
    qsort(x,N,sizeof(gutuie),compara_gutuie); //sortez vectorul de gutui descrescator dupa inaltime
    /*for(i=0;i<N;i++){printf("%ld %ld",x[i].h,x[i].g);
                                 printf("\n");}*/
    for(i=0;i<N;i++){
                     x[i].pas=(H-x[i].h)/U; //calculez pasul la care nu mai poate fi culeasa gutuia i
                     min=minim(x[i].pas,ridic);
                     for(j=min+1;j>=1;j--) //parcurg toti pasii anteriori si daca la pasul j culeg gutuia i
                                           //si obtin o greutate mai buna decat cea dinainte, o retin ca fiind cea mai buna solutie 
                                           //partiala pana la pasul j
                                          if((sol[j-1]+x[i].g)>sol[j]){
                                                                      sol[j]=sol[j-1]+x[i].g;
                                                                      if(sol[j]>max)
                                                                           max=sol[j];
                                                                      if(j==min+1)
                                                                           ridic++;
                                                                           }
                     }
                     
   //afisez maximul               
    fprintf(p,"%d",max);
    fclose(f);
    fclose(p);
    return 0;
}