#include<fstream>
#include<algorithm>
using namespace std;
struct oras
{
	int D,L;
} CITY[50001];
ifstream fi("orase.in");
ofstream fo("orase.out");

int cmp(oras A, oras B)
// returneaza 1 atunci cand A<B
{
	if (A.D<B.D)
		return 1;
	return 0;
}

int main()
{
	int m,n,i,maxd=0,j;
	fi>>m>>n;
	for(i=1;i<=n;i++)
		fi>>CITY[i].D>>CITY[i].L;
	sort(CITY+1,CITY+n+1,cmp);
	for(i=1;i<n;i++)
		for(j=i+1;j<=n;j++)
			if(CITY[j].D+CITY[j].L-CITY[i].D+CITY[i].L>maxd)
				maxd=CITY[j].D+CITY[j].L-CITY[i].D+CITY[i].L;
    fo<<maxd;
	fi.close();
	fo.close();
	return 0;
}