#include<stdio.h>
#include<algorithm>
using namespace std;
const int N=50009;
struct oras
{
	int x,y;
};

oras v[N];
int i,n,m,dmax,k,u;
bool cmp(oras p,oras q)
{
	return p.x<q.x;
}
int main()
{
	freopen("orase.in","r",stdin);
	freopen("orase.out","w",stdout);
	scanf("%d%d",&m,&n);
	for(i=1;i<=n;++i)
		scanf("%d%d",&v[i].x,&v[i].y);
	sort(&v[1],&v[n+1],cmp);
	u=1;
	for(i=2;i<=n;i++)
	{
		k=v[i].x-v[u].x+v[i].y+v[u].y;
		if(dmax<k)
			dmax=k;
		if(v[i].y>v[i].x-v[u].x+v[u].y)
			u=i;
	}
	printf("%d",dmax);
	return 0;
}