#include <fstream>
#include <algorithm>
#define nmax 2005
#define inf 1e18
#define t first
#define p second
#define int long long
using namespace std;
ifstream cin("carnati.in");
ofstream cout("carnati.out");
int n,c,sol;
pair<int,int>v[nmax];
signed main()
{
    cin>>n>>c;
    for(int i=1;i<=n;i++)
        cin>>v[i].t>>v[i].p;
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++){
        int pret=v[i].p,s=0;
        for(int j=1;j<=n;j++){
            int add=pret*(v[j].p>=pret);
            if(s==0){
                if(add>c)
                    s=add;
            }else if(s-(v[j].t-v[j-1].t)*c+add>0)
                s=s-(v[j].t-v[j-1].t)*c+add;
            else{
                if(add>c)
                    s=add;
                else
                    s=0;
            }
            if(add>s)
                s=add;
            sol=max(sol,s);
        }
    }
    cout<<sol-c;
    return 0;
}