#include<stdio.h>
#include<queue>
#include<algorithm>
using namespace std;
priority_queue<int> q;

struct oaie
{
    int p,l;
};

oaie v[100001];

bool cmp(oaie a,oaie b)
{
    if(a.l==b.l)
        return a.l>b.l;
    return a.p>b.p;
}
void scrie(int n)
{
    for(int i=1;i<=n;i++)
        printf("%d %d\n",v[i].p,v[i].l);
}
int main()
{

    freopen("lupu.in","r",stdin);
    freopen("lupu.out","w",stdout);
    int n,max,l,sumMax=0,i;
    scanf("%d%d%d",&n,&max,&l);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&v[i].p,&v[i].l);
    }
    sort(v+1,v+n+1,cmp);//OK
    scrie(n);
    int dist=0;
    int minHeap;
    for(i=1;i<=n;i++)
    {
        if(v[i].p + dist <= max)
        {
            q.push(-v[i].l);
            dist += l;
            sumMax+=v[i].l;
            continue;
        }
        if(q.size()!=0)
        {
            minHeap=-q.top();

            if(minHeap<v[i].l)
            {
                q.pop();
                sumMax -= minHeap;
                q.push(-v[i].l);
                sumMax += v[i].l;
            }

        }
    }
    printf("%d\n",sumMax);
    return 0;

}