/*
 * File:   Problema2.c
 * Author: Bosilca Adrian 325CC
 *
 */

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

int u;

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

void afisare(gutuie v[], int n) {
    int i;
    for (i = 0 ; i < n ; i++) {
        printf("%d %d\n", v[i].g, v[i].h);
    }
}

int comp(const void* a, const void* b) {
    gutuie *c = (gutuie*)a;
    gutuie *d = (gutuie*)b;
    if (c->h / u == d->h / u)
        return (d->g - c->g);
    return ( d->h - c->h );
}

int main() {
    FILE* f = fopen("gutui.in", "r");
    int n, h, i, j, s = 0, dif = 0, max = 0;
    gutuie v[100000];
    int best[100000];

    fscanf(f, "%d %d %d", &n, &h, &u);            //citirea datelor de intrare

    for (i = 0 ; i < n ; i++) {
        fscanf(f, "%d %d", &v[i].h, &v[i].g);
    }
    fclose(f);

    qsort(v, n, sizeof(gutuie), comp);

    afisare(v, n);

    for (i = 0 ; i < n ; i++) {
        best[i] = 0;
        dif = 0;
        for (j = i ; j < n; j++)
            if (v[j].h+dif <= h) {
                best[i] += v[j].g;
                dif += u;
            }
    }

    for (i = 0 ; i < n ; i++)
        printf("%d ", best[i]);

    for (i = 0 ; i < n ; i++)
        if (max < best[i])
            max = best[i];

    f = fopen("gutui.out", "w");
    fprintf(f, "%d", max);
    fclose(f);

    return 0;
}