#include<algorithm>
#include<fstream>
#include<vector>
#include<bitset>
#define NIV(k) ( (Hmax-(k))/Delta + 1)
struct Gutui{ int H, G; };

unsigned N, Hmax, GMax, Delta, maxNiv;
std::vector <Gutui> gutui;
std::bitset<10> best;
bool cmp(const Gutui &x, const Gutui &y){
    return x.G > y.G;
}

void sol(){
	unsigned i=0, nbest=0;
	while( nbest<maxNiv && i<gutui.size() ){
		for(int j=maxNiv-1; j>=0; --j){
		  if( (gutui[i].H+j*Delta) <= Hmax )
		  	 if( !best[j] ){
				best.set(j);
				GMax+=gutui[i].G;
				++nbest;	
				break;
				}
		}
	++i;	
	}   
}    

int main(){
 std::ifstream in("gutui.in");
 std::ofstream out("gutui.out");
 in>>N>>Hmax>>Delta;
 Gutui tmp;
 for(int i=0;i<N;++i){
  in>>tmp.H>>tmp.G;
  gutui.push_back(tmp);
  if(NIV(tmp.H) > maxNiv) maxNiv=NIV(tmp.H);
 }
	
  std::sort(gutui.begin(), gutui.end(), cmp);
  sol();
  out<<GMax;
  out.close();  
 return 0;  
}