#include <bits/stdc++.h>

using namespace std;
map<long long,long long>m;
signed main()
{
ifstream cin("lupu.in");
ofstream cout("lupu.out");
long long n,x,l;
cin>>n>>x>>l;
vector<long long>v(n);
vector<long long>v2(n);
vector<long long>f;
for(int i=0;i<n;i++)
{
    cin>>v[i]>>v2[i];
    if(v[i]>x)
    continue;
    long long k=(x-v[i])/l+1;
    if(m.find(k)==m.end())
    {
        m[k]=v2[i];
        f.push_back(k);
    }
    else
    {
        long long c=m[k];
        m[k]=max(c,v2[i]);
    }
}
long long s=0;
for(int i=0;i<f.size();i++)
{
    s=s+m[f[i]];
}
cout<<s;
    return 0;
}