#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
vector<int> v[100005];
int a[100005];
priority_queue<int> q;
int main()
{
    freopen("lupu.in","r",stdin);
    freopen("lupu.out","w",stdout);
    int n,i,x,l,d;
    scanf("%d%d%d",&n,&x,&l);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&d,&a[i]);
        ///ziua maxima in care poate fi luata i:
        if(d<=x)
            v[((x-d)/l+1)>n?n:((x-d)/l+1)].push_back(i);
    }
    long long ans=0;
    for(int t=n;t>=1;t--)
    {
        for(int i=0;i<(int)v[t].size();i++)
            q.push(a[v[t][i]]);
        if(!q.empty())
            ans+=q.top(),
            q.pop();
    }
    printf("%lld\n",ans);
    return 0;
}