#include <bits/stdc++.h>

#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}
#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}
#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}
#define Size(n) (n).size()

typedef long long ll;


using namespace std;

const int INF = 1e9,MOD = 1e9 + 7,ohara=1e6;
const ll LINF = 1e18;

/*---------------------------------------------------------------
long long int kaizyo(long long int hh){
    cmp=1;
    while(hh>1){
        cmp=(cmp*hh)%MOD;
        hh--;
    }
    return cmp;
}
long long int ruizyo(long long int aa, long long int bb){
    if(aa==0){
        return 1;
    }
    else if(aa%2==0){
        long long int tt=ruizyo(aa/2,bb);
        return (tt*tt)%MOD;
    }
    else{
        return (ruizyo(aa-1,bb)*bb)%MOD;
    }
}フェルマ－のア
---------------------------------------------------------------

while(x!=0){
            sum+=x%10;
          / x/=10;
        }
        各桁の和
---------------------------------------------------------------

pair<int,int> p[100000];
cin >> tmp;
p[i]=make_pair(tmp,i);
cout << p[i].second+1 << endl;//ペアの右側つまりiを出力

---------------------------------------------------------------

bool f[100001];//1000000以下の素数を調べよう！
rrep(i,2,100001){
       f[i]=false;
    }
rrep(i,2,100001){
        if(!f[i]){
            for(int j=i+i;j<=100000;j+=i){
                f[j]=true;
            }
        }
    }
    for(int i=3;i<=100000;i+=2){
        if(!f[i]){
            c[i]++;
        }
    }

---------------------------------------------------------------

long long gcd(long long aaa,long long bbb){
    if(bbb==0){
        return aaa;
    }
    return gcd(bbb,aaa%bbb);
}
 
long long lcm(long long aaa,long long bbb){
    long long g = gcd(aaa,bbb);
    return aaa/g * bbb;
}左から最大公約数と最小公倍数


---------------------------------------------------------------

long long int prime_cnt[10000];
       for(int i=2;i*i<=n;i++){
           while(n%i==0){
               n/=i;
               prime_cnt[i]+=1;
           }
           if(n>1){
               prime_cnt[n]+=1;
               break;
           }
      }ある数nを素因数分解しましょう

---------------------------------------------------------------
debug:
cout<<"i: "<<i<<" j: "<<j<<" cnt: "<<cnt<<"\n";

---------------------------------------------------------------*/

long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x[1000000],v[1000000],y,sum[ohara],summ[ohara],pos,odd[ohara],even[ohara];
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl=true;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);

       cin>>n>>c;
       ll anstrue=0;
       rep(i,n)cin>>x[i]>>v[i];

        rep(i,n){
            sum[i]=v[i];
        }
        rep(i,n-1){
            sum[i+1]+=sum[i];
        }
        pos=0;
        rep(i,n){
            sum[i]-=x[i];
            if(i!=n-1){
            even[i]=max(pos,sum[i]);
            pos=max(pos,sum[i]);
            }
        }
      // reverse(even,even+n-1);

        rrrep(i,n-1,0){
            summ[cnt]=v[i];
            cnt++;
        }
        rep(i,cnt-1){
            summ[i+1]+=summ[i];
        }
        cnt=0;
        pos=0;
        rrrep(i,n-1,0){
            summ[cnt]-=c-x[i];
            if(i!=0){
            odd[cnt]=max(pos,summ[cnt]);
            pos=max(pos,summ[cnt]);
            }
            cnt++;
           // Cout(odd[cnt-1]);
        }
        reverse(odd,odd+cnt-1);
        cnt=0;

       rep(i,n){
           cnt+=v[i];
           ans=cnt-x[i];
           anstrue=max(anstrue,ans);
       }

      // Cout(anstrue);

       ll anss=0;
       cnt=0;
       rrrep(i,n-1,0){
           cnt+=v[i];
           anss=cnt-(c-x[i]);
           anstrue=max(anstrue,anss);
       }

   // Cout(anstrue);

       ans=0;
       cnt=0;
       ll cntt=0,ansfalse=0;
       rep(i,n){
           cntt+=v[i];
           cnt=odd[i];
           ans=cnt+cntt-x[i]*2;
           /*
           rrrep(j,n-1,i+1){
               cnt+=v[j];
               ans=cnt-(c-x[j]);
               ans-=x[i]*2;
               ans+=cntt;
               ansfalse=max(ansfalse,ans);
           }
           */
           anstrue=max(anstrue,ans);
           cnt=0;
       }

       // Cout(anstrue);

       ans=0;cnt=0;cntt=0;ansfalse=0;
       rrrep(i,n-1,1){
           cntt+=v[i];
           cnt=even[i-1];
           ans=cnt+cntt;
           ans-=(c-x[i])*2;
           /*
           rep(j,i){
               cnt+=v[j];
               ans=cnt-x[j];
               ans-=(c-x[i])*2;
               ans+=cntt;
               ansfalse=max(ansfalse,ans);
           }
           */
           anstrue=max(anstrue,ans);
           cnt=0;
       }
       
       Cout(anstrue);
       
return 0;
}


Measured memory_bytes: 15360