#include <fstream>

using namespace std;
long long n,s,t,i,p,u,c[100001],P[100001],d[100001];
long long sol;
ifstream fin ("branza.in");
ofstream fout ("branza.out");

int main (){

    fin>>n>>s>>t;
    for (i=1;i<=n;i++)
        fin>>c[i]>>P[i];
    d[1] = 1;
    p = 1; u = 1;
    sol = ( c[d[p]] + (1-d[p])*s ) * P[1];
    for (i=2;i<=n;i++){
        while (p<=u && c[i] <= c[d[u]] + s*(i-d[u]))
            u--;
        d[++u] = i;
        if (i-d[p] == t+1)
            p++;
        sol += ( c[d[p]] + (i-d[p])*s ) * P[i];
    }
    fout<<sol;


    return 0;
}