#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("carnati.in");
ofstream g("carnati.out");
long long pret[2003],n,c,s,price,profitmax,prc,cost;
struct oameni{
    int h,p;
}v[2003];
bool comp(oameni a, oameni b)
{
    return (a.h<b.h);
}
int main()
{
    f>>n>>c;
    for(int i=1;i<=n;++i)
    {
        f>>v[i].h>>v[i].p;
        pret[i]=v[i].p;
    }
    sort(v+1,v+n+1,comp);
    for(int j=1;j<=n;++j)
    {
        s=0;
        price=pret[j];
        for(int i=1;i<=n;++i)
        {
            if(pret[i]>=price) prc=price-c;
            else prc=-c;
            cost=v[i].h-v[i-1].h-1;
            if(s<=0) s=prc;
            else s+=(prc-cost*c);
            profitmax=max(s,profitmax);
        }
    }
    g<<profitmax;
    return 0;
}