#include <bits/stdc++.h>

using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
deque <int> d;
int n,s,t,p,c[100001];
unsigned long long sum=0;

int main()
{
    fin>>n>>s>>t;
    for(int i=1;i<t;i++)
    {
        fin>>c[i]>>p;
        sum+=c[i]*p;
        while(!d.empty()&&c[d.back()]>=c[i])
            d.pop_back();
        d.push_back(i);
    }
    for(int i=t;i<=n;i++)
    {
        fin>>c[i]>>p;
        while(!d.empty()&&c[d.back()]+s*(i-d.back())>=c[i])
            d.pop_back();
        d.push_back(i);
        if(d.front()<i-t)
            d.pop_front();
        sum+=(c[d.front()]+s*(i-d.front()))*p;
    }
    fout<<sum;
}