#include <iostream>
#include <cstdio>
#include <deque>
#define NMAX 100005

using namespace std;

int n, s, t;
long long suma;
struct numere
{
    int first;
    int second;

}vec[NMAX];

deque<int> dq;

void read()
{
    scanf("%d %d %d\n", &n, &s, &t);
    int x, y;
    for (int i=1; i<=n; i++)
    {
        scanf("%d %d\n", &vec[i].first, &vec[i].second);
    }

}

void verifica(int ind)
{
    while(!dq.empty() && (vec[ind].first < vec[dq.back()].first + s * (ind - dq.back())))
            dq.pop_back();
}
void solve()
{

    dq.push_back(1);
    suma+=vec[1].first * vec[1].second;
    for (int i=2; i<=n; i++)
    {
        if (vec[dq.back()].first + s > vec[i].first)
        {
            verifica(i);
            dq.push_back(i);
        }
        else
            dq.push_back(i);

        suma = suma + vec[dq.front()].first * vec[dq.front()].second;

    }

    cerr<<suma;
}

void debug()
{
    while(!dq.empty())
    {
        cerr<<dq.back();
        dq.pop_back();
    }
}

int main()
{

    freopen("branza.in", "r", stdin);
    freopen("branza.out", "w", stdout);
    read();
    solve();
   // debug();
    return 0;
}