#include <bits/stdc++.h>

using namespace std;

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

long long a[100001];

int main()
{
    long long n, s, t;
    in >> n >> s >> t;

    long long ans = 0;
    deque<long long>deq;

    for (long long i=1; i<=n; i++)
    {
        long long p;
        in >> a[i] >> p;
        while (!deq.empty() && deq.front() < i-t)
            deq.pop_front();

        while (!deq.empty() && a[i] <= a[deq.back()] + (i - deq.back()) * s)
            deq.pop_back();
        deq.push_back(i);
        ans += (a[deq.front()] + s * (i - deq.front())) * p;
    }

    out << ans;

    return 0;
}