#include <fstream>
#include <queue>

using namespace std;

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

int n, t, s;
long long sum;
int c[100001], p[100001];

deque<int> dq;

int main()
{
    in >> n >> s >> t;
    for(int i = 1; i <= n; i++)
    {
        in >> c[i] >> p[i];
        while(!dq.empty() && c[dq.back()]+s*(i-dq.back()) >= c[i])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front() < i-t)
            dq.pop_front();
        sum += (c[dq.front()]+s*(i-dq.front()))*p[i];
    }
    out << sum;
    return 0;
}