#include <fstream>
#include <deque>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");

const int Nmax = 100000 + 5;
long long pret[Nmax], cantitate[Nmax];
int main()
{
    long long n, t, s, cost = 0;
    fin >> n >> s >> t;
    int i;
    deque <int> deq;
    for ( i = 1; i <= n; ++i )
    {
        fin >> pret[i] >> cantitate[i];
        if ( !deq.empty() && deq.front() <= i - t )
            deq.pop_front();

        while ( !deq.empty() && pret[deq.back()] + s * (1LL * i - deq.back()) > pret[i] )
            deq.pop_back();
        deq.push_back(i);

        cost += (pret[deq.front()] + s * (1LL * i - deq.front())) * cantitate[i];

    }
    fout << cost;
    return 0;
}