#include<stdio.h>
#include<algorithm>
using namespace std;

#define MaxN 2100
#define ll long long

typedef struct
{
	int Price;
	int Timp;
} cump;

cump A[MaxN];
int H[MaxN];
int N;
int C;
int sol;
int MAX;

bool cmp(cump a,cump b)
{
	return a.Timp < b.Timp;
}

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

int solve(int a)
{
	int MAX = 0;
	int S = 0;
	for(int i=1;i<=N;i++)
	{
		if(A[i].Price >= A[a].Price)
			S += A[a].Price;
		S -= H[i] * C;
		
		if(S <= 0)
		{
			if(A[i].Price >= A[a].Price)
				S = A[a].Price - C;
			else
				S = -C;
		}
		
		if(MAX < S)
			MAX = S;
	}
	return MAX;
}

int main()
{
	FILE *f = fopen("carnati.in","r");
	FILE *g = fopen("carnati.out","w");
	
	fscanf(f,"%d %d",&N,&C);
	for(int i=1;i<=N;i++)
		fscanf(f,"%d %d",&A[i].Timp,&A[i].Price);
	sort(A+1,A+N+1,cmp);
	H[1] = 1;
	for(int i=2;i<=N;i++)
		H[i] = A[i].Timp - A[i-1].Timp;
	for(int i=1;i<=N;i++)
	{
		sol = solve(i);
		if(MAX < sol)
			MAX = sol;
	}
	fprintf(g,"%d ",MAX);
	
	fclose(g);
	fclose(f);
	return 0;
}