#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
long a;
struct vector {
	long t,p;
};
inline bool cmp(const vector a, const vector b)
{
	return a.t<=b.t;
}
vector v[2010];
long ssm(long pret, int n)
{
	int j;
	long max,s,c,b;
	max=-100000;
	s=0;
	c=v[1].t;
	b=1;
	for(j=1;j<=n;j++) {
			s=s-(v[j].t-c+1)*a;
			if(v[j].p>=pret)
				s=s+pret;
			if(s<=0) {
				c=v[j+1].t;
				s=0;
				b=0;
			}
			if(s>=max)
				max=s;
			if(b==1)
				s=s+(v[j].t-c+1)*a;
			b=1;
	}
	s=s-(v[j-1].t-c+1)*a;
	if(s>max)
		max=s;
	return max;
}
int main ()
{
	int n,i;
	long max,s;
	ifstream f("carnati.in");
	ofstream g("carnati.out");
	f>>n>>a;
	for(i=1;i<=n;i++)
		f>>v[i].t>>v[i].p;
	f.close();
	sort(v+1,v+n+1,cmp);
	max=-1000000;
	for(i=1;i<=n;i++) {
		s=ssm(v[i].p,n);
		if(s>max)
			max=s;
	}
	if(max)
		g<<max;
	else g<<'0';
	g.close();
	return 0;
}