#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("lupu.in");
ofstream cout("lupu.out");

class Oaie{
public:
    int distInit;
    int cantitateLana;
    int zona;
};

class Compare{
public:
    bool operator()(Oaie a,Oaie b){
        if(a.cantitateLana == b.cantitateLana)
            return a.zona < b.zona;
        return a.cantitateLana < b.cantitateLana;
    }
};

int n,x,lng;///n:nr oi,x:distanta maxima lup oi,l:distanta de departare oi lup
int maxZona=0;
vector<Oaie> v;


void read(){
    cin>>n>>x>>lng;
    v.resize(n+1,{0,0,-1});
    for(int i=1;i<=n;i++){
        cin>>v[i].distInit>>v[i].cantitateLana;
        if(v[i].distInit>x)
            v[i].zona=-1;
        else{
            v[i].zona = (v[i].distInit + 1) / lng;
            maxZona =  max(maxZona,v[i].zona);
        }
    }
}

void solve(){
    long long int res=0;
    priority_queue<Oaie,vector<Oaie>,Compare> Q(v.begin()+1,v.end());

    int i =1,zona = 0;
    while(!Q.empty() and maxZona>=0){
        while(!Q.empty() and maxZona>=0 and Q.top().zona <= maxZona){
            res += Q.top().cantitateLana;
            ///cout << "Taking zona " << Q.top().zona << " cantitate : " << Q.top().cantitateLana << " init dist : " << Q.top().distInit << "\n";
            maxZona--;
            Q.pop();
        }
        while(!Q.empty() and Q.top().zona > maxZona){
            Q.pop();
        }
    }

    cout<<res;
}

int main() {

    read();
    solve();
    return 0;
}