#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//cout<<setprecision(20)
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<lldo>&ar,lldo in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<lldo>&ar,lldo in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	llint D,Q;cin>>D>>Q;
	set<pair<llint,int>>aaa;
	//in->0 out->1
	llint ans=0;
	while(Q--){
		llint A,B;cin>>A>>B;B++;
		while(aaa.lower_bound(mp(A,-1))!=aaa.upper_bound(mp(B,9))){
			auto itr=aaa.lower_bound(mp(A,-1));
			aaa.era(itr);
		}
		auto intr=aaa.ins(mp(A,0));
		if(intr.sec&&intr.fir!=aaa.begin()&&prev(intr.fir)->sec==0){
			aaa.era(intr.fir);
		}
		auto outr=aaa.ins(mp(B,1));
		if(outr.sec&&next(outr.fir)!=aaa.end()&&next(outr.fir)->sec==1){
			aaa.era(outr.fir);
		}
		llint inti=prev(aaa.lower_bound(mp(A,9)))->fir;
		llint outi=aaa.lower_bound(mp(B,-1))->fir;
		maxeq(ans,outi-inti);
		cout<<ans<<endl;
	}
	return 0;
}