#include "bits/stdc++.h" using namespace std; typedef long long ll; #define INF (1<<30) #define INFLL (1ll<<60) typedef pair P; typedef pair 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],s[100100]; int main(void){ int n,i; ll m,ans,p=0ll,q=0ll,x,y; cin >> n >> m; for(i=0; i> a[i] >> b[i]; } for(i=(n-1); i>=0; --i){ if(p==0){ q = max(0ll,q); } 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); } } ans = max(p+q,p*m+q); cout << ans << endl; return 0; }