#include <iostream>
#include <queue>
#include <fstream>
#include <utility>

using namespace std;

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

pair<int, int> H;
priority_queue<pair<int, int>, vector<pair<int, int> > > pq;

int main(){
  int N, X, L;
  in >> N >> X >> L;
  for(int i = 0; i<N; i++){
    int D, F;
    in >> D >> F;
    H = make_pair(F, D);
    pq.push(H);
  }
  int total = 0;
  int step = 0;
  while(pq.empty() == false){
    int add = L * step;
    if(pq.top().second + add <= X){
      total+=pq.top().first;
      step++;
    }  
    pq.pop();
  }
  out << total;
}