#include <bits/stdc++.h>
using namespace std;
long long pret[100001],prod[100001];
deque <long long> dq;
int main(){
ifstream cin("branza.in");
ofstream cout("branza.out");
long long n,s,t,i,afis;
cin >> n >> s >> t;
for(i=1;i<=n;i++)
cin >> pret[i] >> prod[i];
afis=0;
for(i=1;i<=n;i++){
while(!dq.empty()&&dq.front()<=i-t-1)
dq.pop_front();
while(!dq.empty()&&pret[i]<=pret[dq.back()]+s*(i-dq.back()))
dq.pop_back();
dq.push_back(i);
afis+=prod[i]*(pret[dq.front()]+s*(i-dq.front()));
}
cout << afis;
return 0;
}