#include <bits/stdc++.h>

using namespace std;

ifstream f("branza.in");
ofstream g("branza.out");

long long C[100005];
int main(){
    long long N, S, T, P, i, s = 0;

    deque<int> d;

    f >> N >> S >> T;

    T++;

    for(i = 0; i < N; i++)
        {
        f >> C[i] >> P;
        if(!d.empty() && d.front() == i - T)
            d.pop_front();

        while(!d.empty() && C[i] <= C[d.back()] + S * (i - d.back()))
            d.pop_back();
        d.push_back(i);
        s += (long long)P * (C[d.front()] + S * (i - d.front()));
        }

    g << s;
}