#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

const int N = 1e5 + 7;
int n, i, S, T;
int c[N], p[N];
long long rez;

deque <int> deq;

int main()
{
    fin >> n >> S >> T;
    for(i = 1; i <= n; i++){
        fin >> c[i] >> p[i];
    }
    for(i = 1; i <= n; i++){
        while(!deq.empty() && c[i] <= c[deq.back()] + S * (i - deq.back()))
            deq.pop_back();

        deq.push_back(i);


        if(i - deq.front() == T)
            deq.pop_front();

        rez = rez + 1LL * (c[deq.front()] + S * (i - deq.front())) * p[i];


    }
    fout << rez;
    return 0;
}