#include <bits/stdc++.h>
#define int long long
using namespace std;

int32_t main()
{
    freopen("branza.in", "r", stdin);
    freopen("branza.out", "w", stdout);
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, d, m;
    cin >> n >> d >> m;
    vector<int> v(n + 1), c(n + 1), q(n + 1);
    for(int i = 1; i <= n; i++)
    {
        cin >> c[i] >> q[i];
        v[i] = c[i] - d * i;
    }
    deque<pair<int, int>> dq;
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        while(dq.size() && dq.back().first > v[i])
        {
            dq.pop_back();
        }
        if(dq.size() && dq.front().second < i - m)
        {
            dq.pop_front();
        }
        dq.push_back({v[i], i});
        ans += (dq.front().first + d * i) * q[i];
    }
    cout << ans;
}