#include <bits/stdc++.h>

using namespace std;

ifstream fin("carnati.in");
ofstream fout("carnati.out");

int c, n, ans;
pair <int,int> v[2005];

int main()
{

    fin >> n >> c;

    for(int i = 1; i <= n; i++)
        fin >> v[i].first >> v[i].second;
    sort(v+1, v+1+n);
    for(int i = 1; i <= n; i++)
    {
        int x = v[i].second, t, p;
        t =0;
        p = -69696969;
        for(int j = 1; j <= n; j++)
        {
            if(v[j].second >= x)
            {
                if(p+x-(v[j].first-t)*c < x-c) p = x-c;
                else
                    p = p+x-(v[j].first-t)*c;
                t = v[j].first;
                ans = max(p, ans);

            }
        }
    }

    fout << ans;


    return 0;
}