#include <bits/stdc++.h>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int n, cSapt, tMax;
int rez = 0;
deque<int> dq;
struct Iris {
int cost, need;
}v[100003];
int main()
{
fin >> n >> cSapt >> tMax;
for(int i=1; i<=n; i++) fin >> v[i].cost >> v[i].need;
for(int i=1; i<=n; i++) {
while(!dq.empty() && v[i].cost <= v[dq.back()].cost + cSapt * (i - dq.back())) dq.pop_back();
dq.push_back(i);
if(!dq.empty() && i - dq.front() > tMax) dq.pop_front();
//cout << "iau " << v[i].need << " din " << dq.front() << " => " << v[i].need * v[dq.front()].cost << '\n';
rez += v[i].need * v[dq.front()].cost + v[i].need * cSapt * (i - dq.front());
}
fout << rez;
return 0;
}