#include <bits/stdc++.h>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int n,C,t;
deque<int> dq;
struct da
{
int cost;
int need;
}v[100003];
long long rez;
int main()
{
fin>>n>>C>>t;
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+C*(i-dq.back())) dq.pop_back();
dq.push_back(i);
rez+=v[dq.front()].cost*v[i].need+v[i].need*C*(i-dq.front());
if (i-dq.front()==t) dq.pop_front();
}
fout<<rez;
return 0;
}