#include<cstdio>
#include<algorithm>
using namespace std;
struct eu{long long t,val;};
eu v[2001];
long long i,j,sum,n,m,k,cate,p1;
long long valmax,c;
int main ()
{
freopen("carnati.in","r",stdin);
freopen("carnati.out","w",stdout);
scanf("%lld%lld",&n,&c);
for(i=1;i<=n;i++)
    scanf("%lld%lld",&v[i].t,&v[i].val);
for(int qq=1;qq<=n;qq++)
    {
    long long x=v[qq].val;
    long long sum=0,p1=1,h=0;
    for(i=1;i<=n;i++)
        {
        if(v[i].val>=x)
            sum=max(sum+x-c*(v[i].t-v[i-1].t),x-c);
        else
            sum=max(h,sum-c*(v[i].t-v[i-1].t));
        if(sum>valmax)
            valmax=sum;
        }
    }
printf("%lld",valmax);
return 0;
}