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