#include <stdio.h>

#define fin  "carnati.in"
#define fout "carnati.out"

const int Nmax = 2010;

struct inf
{
	int timp;
	long cst;
};

int N,C;
inf v[Nmax];

long best;
long a[Nmax];

inline long max(long a,long b) { return (a>b)?(a):(b); }

void quicksort(int st,int dr)
{
	int m,i,j;
	inf aux;

	m = (st + dr) / 2;

	i = st; j = dr;

	do
	{
		while ( v[i].timp < v[m].timp ) ++i;
		while ( v[j].timp > v[m].timp ) --j;
		if ( i <= j )
		{
			aux = v[i];
			v[i] = v[j];
			v[j] = aux;
			++i;
			--j;
		}
	} while ( i < j );

	if ( i < dr ) quicksort(i,dr);
	if ( j > st ) quicksort(st,j);
}

void readsolve()
{
	int i,j,pret;

	freopen(fin,"r",stdin);
	freopen(fout,"w",stdout);

	scanf("%i%ld",&N,&C);

	for ( i = 1; i <= N; ++i )
		scanf("%i%ld",&v[i].timp,&v[i].cst);

	quicksort(1,N);

	best = v[1].cst - C;

	for ( i = 1; i <= N; ++i )
	{
		pret = v[i].cst;

		if ( v[1].cst >= pret )
			a[1] = max(0,pret - C);
		else
			a[1] = 0;

		for ( j = 2; j <= N; ++j )
			if ( v[j].cst >= pret )
			{
				a[ j ] = max(a[j-1]-(v[j].timp-v[j-1].timp)*C+pret,pret-C);
                a[ j ] = max(a[ j ],0);
            }
			else
				a[ j ] = max(a[j-1]-(v[j].timp-v[j-1].timp)*C,0);

		for ( j = 1; j <= N; ++j )
			best = max(best,a[j]);
	}

	printf("%ld\n",best);
}

int main()
{
	readsolve();
	return 0;
}