#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int n , t , s , c[100001] , p[100001];
int rez;
deque<int> dq;
signed main(){
fin >> n >> s >> t;
for(int i = 1 ; i <= n ; i++) fin >> c[i] >> p[i];
for(int i = 1 ; i <= n ; i++){
while(!dq.empty() && c[dq.back()] - dq.back() * s >= c[i] - i * s) dq.pop_back();
if(!dq.empty() && dq.front() < i - t) dq.pop_front();
dq.push_back(i);
rez += (c[dq.front()] + (i - dq.front()) * s) * p[i];
}
fout << rez;
}