#include <deque>
#include <fstream>
#include <iostream>
using namespace std;

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

const int MAX_N = 100100;

int N, S, T;
int C[MAX_N], P[MAX_N];
deque<pair<int, int> > dq;

int main() {
  fin >> N >> S >> T;

  int answer = 0;
  for (int i = 1; i <= N; ++i) {
    fin >> C[i] >> P[i];
    //cerr << i << ' ' << C[i] << ' ' << P[i] << endl;
    while (!dq.empty() && dq.back().first + (i - dq.back().second) * S > C[i]) {
      dq.pop_back();
    }
    dq.push_back(make_pair(C[i], i)); 
    if (!dq.empty() && i - dq.front().second > T) {
      dq.pop_front();
    }
    
    //cerr << dq.front().first << ' ' << dq.front().second << endl;
    answer += dq.front().first * P[i] + S * (i - dq.front().second) * P[i];
    //cerr << answer << endl;
  }

  fout << answer;
  return 0;
}