#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 2005;
pair <int, int> v[maxn];
int n, c;
int profit(int pret)
{
    int ret = 0;
    int s = 0;
    for(int i = 1; i <= n; i++)
    {
        int salariu = (v[i].first - v[i-1].first) * c;
        s = s - salariu;
        s = max(s, 0);
        if(pret <= v[i].second)
            s += pret;
        ret = max(ret, s - c);
    }
    return ret;
}
int main()
{
    freopen("carnati.in", "r", stdin);
    freopen("carnati.out", "w", stdout);
    scanf("%d%d", &n, &c);
    for(int i = 1; i <= n; i++)
        scanf("%d%d", &v[i].first, &v[i].second);
    sort(v + 1, v + n + 1);
    int mx = 0;
    for(int i = 1; i <= n; i++)
        mx = max(mx, profit(v[i].second));
    printf("%d\n", mx);
    return 0;
}