#include <stdio.h>
#define NMAX 100000

typedef struct deque
{
    long long poz;
	long long e;
};
deque d[NMAX+5];

template <class T> min(T a, T b){ if(a<b) return a; return b;}

//inline long long min(long long a, long long b) { return (a < b) ? a : b; }

long long st, dr;
long long c[NMAX+5], p[NMAX+5];
long long n, t, s;
long long res;

int main()
{
	long long i;
    long long aux;
	freopen("branza.in", "r", stdin);
	freopen("branza.out", "w", stdout);

	st = 1;
	dr = 1;
	scanf("%lld %lld %lld", &n, &s, &t);
	scanf("%lld %lld", c+1, p+1);
	res += (long long)c[1]*p[1];
	d[1].poz = 1;
	d[1].e = (long long)c[1] + s*(n-1);

	for(i = 2; i <= n; ++i)
	{
		scanf("%lld %lld", c+i, p+i);
		aux = c[i];

	//	if(d[st].poz <= i-t)
			while(d[st].poz<=i-t)
			++st;

		aux = min(aux, (long long)d[st].e - s*(n-i));

		res += (long long)aux*p[i];
		aux += (long long)s*(n-i);

		while(dr >= st-1 && d[dr].e >= aux)
			--dr;
		d[++dr].poz = i;
		d[dr].e = aux;
	}
	printf("%lld\n", res);
	return 0;
}