#include <fstream>
#include <deque>
#define nmax 10005
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
int n,s,t,c[nmax],p[nmax];
long long sum;
deque <int > v;

int main()
{
    int i;
    f>>n>>s>>t;
    for (i=1;i<=n;i++) {
        f>>c[i]>>p[i];

        while (!v.empty()&&1LL* c[i]<=c[v.back()]+1LL*s*(i-v.back()))
            v.pop_back();

        v.push_back(i);
        if (i-v.front()>t)
            v.pop_front();
        sum+=1LL*(c[v.front()]+(i-v.front())* 1LL*  s) * p[i];
    }
    g<<sum;
    return 0;
}