#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a += b;
	a %= MOD;
}

ll a[100100],b[100100];

int main(void){
	int n,i;
	ll m,ans,p=0ll,q=0ll;
	cin >> n >> m;
	for(i=0; i<n; ++i){
		cin >> a[i] >> b[i];
	}
	for(i=(n-1); i>0; --i){
		if(a[i]<0 && (!b[i]<0)){
			a[i] = 0;
		}
		if(p+a[i]<0ll){
			q = max(p*m+q+b[i],p+q+a[i]);
			p = 0ll;
		}else{
			p += a[i];
			q += max(b[i]-a[i],0ll);
		}
		q = max(0ll,q);
	}
	for(i=1; i<=m; ++i){
		ans = max(ans,p*i+q+a[0]*i);
		ans = max(ans,p*m+q+a[0]*(i-1)+b[0]);
	}
	cout << ans << endl;
	return 0;
}