#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
struct oita{
int d, l;

}v[1000000000];


int comparator(const void *p, const void *q)
{
    int l = ((struct oita *)p)->d;
    int r = ((struct oita *)q)->d;
if(l-r>0)
    return -1;
if(l-r<0)
    return 1;
if(l-r==0)
{
int l = ((struct oita *)p)->l;
    int r = ((struct oita *)q)->l;
    return (r-l)  ;
}


}



int main()
{
ifstream f("lupu.in");
ofstream g("lupu.out");
int n,m,dist;
f>>n>>m>>dist;
int i;
for(i=1;i<=n;i++)
{
    f>>v[i].d>>v[i].l;


}
 qsort (v, n, sizeof(struct oita), comparator);

int s=0;
for(i=1;i<=n;i++)
    {
	if(v[i].d<=m)
    {
     s=s+v[i].l;
cout<<s<<" ";
     int j;
     for(j=i+1;j<=n;j++)
        v[j].d=v[j].d+dist;

    }}

g<<s;
    return 0;
}