#include <cstdio>
#include <algorithm>
#include <deque>
#define Dim 100002

using namespace std;
int n, s, t;
long long sol;
deque <long long> d;
struct nod
{
    long long p;
    long long c;
}v[Dim];
void read()
{
    freopen("branza.in", "r", stdin);
    freopen("branza.out", "w", stdout);
    scanf("%d %d %d", &n, &s, &t);
    for(int i = 1; i <= n; ++ i)
    {
        scanf("%lld %lld", &v[i].p, &v[i].c);
        v[i].p += (n - i) * s;
    }
}
void solve()
{
    for(int i = 1; i <= n; ++ i)
    {
        if(d.front() < i - t)
            d.pop_front();
        while(!d.empty() && v[i].p < v[d.back()].p)
            d.pop_back();
        d.push_back(i);
        sol += (v[d.front()].p - s * (n - i)) * v[i].c;
    }
}
void write()
{
    printf("%lld\n", sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}