#include <bits/stdc++.h>

using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
deque < pair <long long, int> > dq;
int main()
{
    int n,t,s,i,p,c;
    long long sum = 0;
    fin >> n >> s >> t;
    for(i = 1; i <= n; i++){
        fin >> p >> c;
        while(!dq.empty() && dq.front().second < i - t) dq.pop_front();
        while(!dq.empty() && dq.back().first > p - i * s) dq.pop_back();
        dq.push_back({p - i * s, i});
        sum += c * (i * s + dq.front().first);
    }
    fout << sum;
    return 0;
}