#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, d,t[110],k[110];
	cin >> n >> d;
	for (int i = 0;i < n;i++) {
		cin >> t[i] >> k[i];
	}

	int dp[110][2];
	dp[0][0] = t[0];
	dp[0][1] = k[0] - d;
	for (int i = 1;i < n;i++) {
		dp[i][0] = max(dp[i - 1][0] + t[i], dp[i - 1][1] + t[i] - d);
		dp[i][1] = max(dp[i - 1][0] + k[i] - d, dp[i - 1][1] + k[i]);
	}
	cout << max(dp[n - 1][0], dp[n - 1][1]) << endl;

	return 0;
}