#include <stdio.h>
#include <algorithm>
using namespace std;
struct oras {
	int l,d;
} v[1000000];
int functie (oras a,oras b){
	return a.d<=b.d;
}
int m,n,d[50001],l[50001],i,j,maxx,p;
int main() {
	FILE *f=fopen("orase.in","r");
	FILE *g=fopen("orase.out","w");
	fscanf(f,"%d%d",&m,&n);
	for(i=1;i<=n;i++)
		fscanf(f,"%d%d",&v[i].d,&v[i].l);
	sort(v+1,v+n+1,functie);
	p=1;maxx=0;
	for(i=2;i<=n;i++)
		 if(maxx<v[i].d-v[p].d+v[i].l+v[p].l)
		 {
			maxx= v[i].d-v[p].d+v[i].l+v[p].l;
			p=i;
		 }
	fprintf(g,"%d",maxx);
	return 0;
}