#include <iostream>
#include <fstream>
#include <deque>
#define MAX_N 100001
using namespace std;
deque<long> d;
long C[MAX_N],P[MAX_N],n,t;
long long total;
int s;
void citeste()
{
    ifstream f("branza.in");
    f>>n>>s>>t;
    for(int i=1;i<=n;i++)
        f>>C[i]>>P[i];
    f.close();
}
int main()
{
    citeste();
    for(int i=1;i<=n;i++)
    {
        while(!d.empty()&&C[i]<C[d.back()]+(i-d.back())*s)d.pop_back();
        d.push_back(i);
        if(d.front()==i-t)d.pop_front();
        total+=(C[d.front()]+(i-d.front())*s)*P[i];
    }
    ofstream g("branza.out");
    g<<total;
    g.close();
    return 0;
}