#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

vector< pair<long long,long long> > values;
int main()
{
    long long n,x,l;
    fin >> n >> x >>l;
    for (long long i=0;i<n;i++)
    {
        long long a,b;
        fin >> a >> b;
        values.push_back(make_pair(a,b));
    }
    sort(values.rbegin(),values.rend());

    long long lu = x;
    long long ll = x-l+1;
    long long maxim=0;
    long long total=0;
    for (long long i=0;i<n;i++)
    {
        if (ll<=values[i].first&&values[i].first<=lu)
        {
            maxim  = max(values[i].second,maxim);
        }
        else
        {
            total += maxim;
            maxim = values[i].second;
           // cout << maxim <<endl;
            lu = values[i].first + (l - values[i].first%l)%l;// round up
            ll = lu - l +1;
           // cout << ll<<" "<<lu<<endl;
        }
    }
    total+=maxim;
    fout << total;
}