// Voiculescu Rafaela 321CA

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

typedef struct{
    unsigned int h; //inaltimea crengii pe care se afla gutuia
    unsigned int g; //greutatea gutuii
} gutuie;

int compara(void* a,void* b)
{
    unsigned int val_a,val_b,vala,valb;
    val_a=(*((gutuie *)a)).h;
    val_b=(*((gutuie *)b)).h;
    vala=(*((gutuie *)a)).g;
    valb=(*((gutuie *)b)).g;
    if(vala<valb)
        return 1;
    else
        if(vala>valb)
            return -1;
        else
        {
            if(val_a<val_b)
                return 1;
            else
                if(val_a>val_b)
                    return -1;
                else
                    return 0;
        }
}

int main()
{
    //deschidere fisier de intrare, respectiv fisier de iesire
    FILE *in,*out;
    in=fopen("gutui.in","r");
    out=fopen("gutui.out","w");

    //citim numarul de gutui, inaltimea maxima si cu cat se ridica crengile
    int N,H,U;
    fscanf(in,"%d%d%d",&N,&H,&U);

    gutuie *date;
    date=(gutuie*) calloc(N,sizeof(gutuie));

    int i,k;
    unsigned int nr_max_gutui;
    //unsigned int *v,*w;

    //v=(unsigned int *) calloc(N,sizeof(unsigned int));
    //w=(unsigned int *) calloc(N,sizeof(unsigned int));

    //citim datele despre fiecare creanga
    for(i=0;i<N;i++)
        fscanf(in,"%u%u",&date[i].h,&date[i].g);

    qsort(date,N,sizeof(gutuie),(__compar_fn_t)&compara);

    //for(i=0;i<N;i++)
      //  printf("%u %u\n",date[i].h,date[i].g);
    unsigned int minim=date[0].h;
    for(i=1;i<N;i++)
        if(date[i].h<minim)
            minim=date[i].h;

    //printf("%u\n",minim);
    nr_max_gutui=(H-minim)/U + 1;  //cate gutui ar putea fi maxim culese a.i. sa se respecte conditiile
    //printf("%u\n",nr_max_gutui);

    int culese=0;
    unsigned int suma=0;

    for(i=0;i<N;i++) 
        if(culese<nr_max_gutui)
            if(date[i].h+U*culese<H)   //poate fi culeasa in conditiile date
            {
                suma+=date[i].g;
                culese++;
            }
        fprintf(out,"%u\n",suma);
  /*  for(i=0;i<N;i++)
        v[i]=date[i].g;

    nr_max_gutui=(H-date[N-1].h)/U + (date[N-1].h%U==0 ? 0:1);  //cate gutui ar putea fi maxim culese a.i. sa se respecte conditiile

    for(k=1;k<=nr_max_gutui;k++)
    {
        
    }*/
    free(date);
    fclose(in);
    fclose(out);
    return 0;
}