#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lupu.in");
ofstream fout("lupu.out");
int main()
{
long long N,L,X,S=0,i;
f>>N>>X>>L;
struct oaie{ int D,L;}a[100005];
for(i=1;i<=N;i++)
    f>>a[i].D>>a[i].L;
int minim=a[1].D,maxim=0;
for(i=2;i<=N;i++)
 if(minim>a[i].D)
minim=a[i].D; int pal=0;
while(minim<=X)
{ for(i=1;i<=N;i++)
    if((a[i].D+pal>=X-L+1)&&(a[i].D+pal<=X))
        if(maxim<a[i].L)
            maxim=a[i].L;
S=S+maxim;
minim=minim+L;
maxim=0;
pal=pal+2;
}
fout<<S;
return 0;
}