#include<iostream>
#include<cstdio>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
int read(){
	int u=0;
	char c=getchar();
	while(c>'9'||c<'0')c=getchar();
	while(c>='0'&&c<='9')u=u*10+c-48,c=getchar();
	return u;
}
int n;
long long r2;
long long s[200011],w[200011];
bool solve_l(long long l){
	long long R=0;
	fo(i,1,n){
		R=min(R+w[i],min(r2,R+w[i]-l+s[i]));
		if(R<0)return 0;
	}
	return 1;
}
bool solve_r(long long r){
	long long L=0;
	fo(i,1,n){
		L=L+w[i]-r+s[i];
		if(L<0)L=0;
		if(L>r2||(i==n&&L>0))return 0;
	}
	return 1;
}
int main(){
	n=read();
	r2=read();
	fo(i,1,n){
		s[i]=read();
		w[i]=read();
	}
	long long ans=0;
	long long l=0,r=1999999999,mid;
	while(l<r){
		mid=(l+r+1)/2;
		if(solve_l(mid))l=mid;
		else r=mid-1;
	}
	ans-=l;
	l=0,r=1999999999,mid;
	while(l<r){
		mid=(l+r)/2;
		if(solve_r(mid))r=mid;
		else l=mid+1;
	}
	printf("%lld",ans+r);
	return 0;
}