# include <bits/stdc++.h>

using namespace std;

const int Nmax = 2000 + 5;

struct da
{
    int cost, timp;
};
da a[Nmax];

int n, i, x, y, Cost, j;
long long ans, A, B, P, c;

int cmp (da A, da B)
{
    return A.timp < B.timp;
}

int main ()
{
    freopen("carnati.in", "r", stdin);
    freopen("carnati.out", "w", stdout);

    scanf("%d %lld\n", &n, &c);

    for (i = 1; i <= n; ++i)
    {
        scanf("%d %d\n", &x, &y);
        a[i].cost = y, a[i].timp = x;
    }

    sort(a + 1, a + n + 1, cmp);

    a[0].timp = -10;

    for (i = 1; i <= n; ++i)
    {
        B = -10 , Cost = a[i].cost;

        if (B >= Cost) B = Cost - c;
            else B = 0;

        ans = max(ans, B);

        for (j = 1; j <= n; ++j)
        {

            if (a[j].cost >= Cost) P = Cost;
            else P = 0;

            A = max (B + P - (a[j].timp - a[j - 1].timp) * c, P - c);
            B = A;
            ans = max(ans, A);
        }
    }

    printf("%lld\n", ans);

    return 0;
}