#include <fstream>
#include <deque>

using namespace std;

ifstream cin("branza.in");
ofstream cout("branza.out");

typedef long long ll;

deque<int> dq;
int n, s, t, p;
ll ans;

int main()
{
	cin >> n >> s >> t;
	int* c = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> c[i] >> p;
		if (!dq.empty() && dq.front() == i - t)
		{
			dq.pop_front();
		}
		while (!dq.empty() && c[dq.back()] + (i - dq.back()) * s > c[i])
		{
			dq.pop_back();
		}
		dq.push_back(i);
		ans += (ll)((c[dq.front()] + (i - dq.front()) * s) * p);
	}
	cout << ans;
	cin.close();
	cout.close();
	return 0;
}