#include <bits/stdc++.h>
#define ll long long
 
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
const int MaxN = 100005;
ll n, s, k, cost[MaxN], dem[MaxN], ans;
deque<ll> dq;
 
int main()
{
    f >> n >> s >> k;
    for (int i = 1; i <= n; ++i) f >> cost[i] >> dem[i];
    for (int i = 1; i <= n; ++i) {
        if (!dq.empty() && i > k + 1 && cost[i - k - 1] - s * (i - k - 1) <= dq.front()) dq.pop_front();
        while (!dq.empty() && dq.back() > cost[i] - s * i) dq.pop_back();
        dq.push_back(cost[i] - s * i);
        ans += dem[i] * (dq.front() + s * i);
    }
    g << ans << '\n';
    return 0;
}