#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cassert>
#include <map>
#include <set>
using namespace std;
typedef long long LL;

#ifdef INFOARENA
#define ProblemName "lupu"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif
typedef long long LL;

map< int, vector<int> > M;

inline int getTura(int X, int K, int d) {
	int z = (X - d) / K;
	return z;
}

int main() {
	freopen(InFile, "r", stdin);
	freopen(OuFile, "w", stdout);
	int N, X, L;
	scanf("%d%d%d", &N, &X, &L);
	assert(L != 0);
	for (int i = 0; i < N; ++i) {
		int d, a;
		scanf("%d%d", &d, &a);
		int t = getTura(X, L, d);
		if (t < 0) continue;
		M[-t].push_back(a);
	}
	int take = 0, prv = -M.begin()->first + 1;
	assert(-M.begin()->first < prv);
	LL ans = 0;
	priority_queue<int> Q;
	for (const auto &it : M) {
		take += prv + it.first;
		assert(take > 0);
		prv = -it.first;
		for (const auto &it2 : it.second)
			Q.push(it2);
		for (; take > 0 && !Q.empty(); --take, Q.pop())
			ans += Q.top();
	}
	assert(take == 0);
	printf("%lld\n", ans);
	return 0;
}