#include <fstream>
#include <algorithm>

#define NMAX 100002
#define INF 1e9
using namespace std;

ifstream fin ("lupu.in");
ofstream fout ("lupu.out");

struct oaie{int it, lana;};

int n, x, l;
oaie a[NMAX]; //a[i].it = la al catalea pas pot maxim sa o iau

bool compar(oaie a, oaie b)
{
    if(a.lana == b.lana) return a.it < b.it;
    return a.lana > b.lana;
}

int main()
{
    int i, d, aux;
    fin>>n>>x>>l;
    for(i = 1; i <= n; i++)
    {
        fin>>d>>aux;
        if(d > x) //oricum nu as putea sa o iau
        {
           a[i].it = INF;
           a[i].lana = -INF;
        }
        else
        {
           a[i].it = (x - d) / l + 1;
           a[i].lana = aux;
        }
    }
    //sortez crescator dupa .it si (in caz de egalitate) descrescator dupa .lana
    sort(a + 1, a + n + 1, compar);
    for(i = 1; i <= n; i++) fout<<a[i].it<<' '<<a[i].lana<<'\n';
    long long int rez = 0;
    int ales = 0; //cate oi am ales
    int extra = 0;
    for(i = 1; i <= n; i++)
    {
        if(a[i].it > ales) //mai aleg o oaie
        {
           ales++;
           rez += a[i].lana;
        }
    }
    fout<<rez<<'\n';
    return 0;
}