#include <iostream>
#include <fstream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("lupu.in");
ofstream g("lupu.out");

//x->distanta max la care lupul poate alege oi
//l->distanta cu care se muta toate oile dupa fiecare alegere
int n, x, l;
vector<pair<int,int>> v;
multiset <int> s;
void citire()
{
	f >> n >> x >> l;
	int i;
	v.resize(n + 3);
	for (i = 0; i <n; i++)
	{
		f >> v[i].first >> v[i].second;
	}
	f.close();
}
int main()
{
	citire();
	sort(v.begin(), v.begin() + n);
	int i;
	/*for (i = 0; i <= n; i++)
		g << v[i].first << " ";*/
	int q = x % l;
	int nr = 0;
	i = 0;
	while (i <= n && nr<=q)
	{
		if (v[i].first <= nr)
		{
			s.insert(-v[i].second);
			i++;
		}
		else
			nr++;
	}
	int suma = 0;
	suma += (*s.begin());
	s.erase((*s.begin()));
	nr = i;
	int j = 1; 
	for (i = nr; i <= n; i++)
	{
		if (v[i].first <= l*j && v[i].first>l*(j-1))	//este in interval de l
		{
			s.insert(-v[i].second);
		}
		else //trec la un nou interval
		{
			j++;
			if (s.size()) //adaug maximul la suma
			{
				suma += (*s.begin());
				s.erase((*s.begin()));
			}
			s.insert(-v[i].second);
		}
	}
	g << -suma << "\n";
	g.close();
	return 0;
}