#include <bits/stdc++.h>
#define MAXN 100000

using namespace std;

ifstream fin("branza.in");
ofstream fout("branza.out");

long long pret[MAXN + 1], produs[MAXN + 1];

int main()
{
    long long n, s, t, i, afis;

    fin >> n >> s >> t;

    for(i = 1; i <= n; i++){
        fin >> pret[i] >> produs[i];
    }

    deque <long long> dq;
    afis = 0;
    for(i = 1; i <= n; i++){
        while(!dq.empty() && pret[i] <= pret[dq.back()] + s * (i - dq.back())){
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front() == i - t){
            dq.pop_front();
        }
        afis += produs[i] * (pret[dq.front()] + s * (i - dq.front()));
    }

    fout << afis << "\n";
    return 0;
}