#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
inline void read(int &x){
	x=0;char ch;bool flag = false;
	while(ch=getchar(),ch<'!');if(ch == '-') ch=getchar(),flag = true;
	while(x=10*x+ch-'0',ch=getchar(),ch>'!');if(flag) x=-x;
}
inline int cat_min(const int &a,const int &b){return a<b ? a:b;}
inline int cat_max(const int &a,const int &b){return a>b ? a:b;}
const int maxn = 200000;
int nx[maxn];
bool vis[maxn];
inline int jump(int l,int r){
	int p = l,cnt = 0;
	int x = -1;
	while(p <= r && p != -1){
		if(!vis[p]) ++cnt;
		vis[p] = true;
		x = nx[p];
		nx[p] = nx[r];
		p = x;
		//printf("%d\n",x);
	}
	return cnt;
}
int main(){
	freopen("Axis.in","r",stdin);
	freopen("Axis.out","w",stdout);
	int n,m;read(n);read(m);
	for(int i=1;i<=n;++i) nx[i] = i+1;
	nx[n] = -1;
	int ans = n;
	for(int i=1,u,v;i<=m;++i){
		read(u);read(v);
		ans -= jump(u,v);
		printf("%d\n",ans);
	}
	getchar();getchar();
	fclose(stdin);fclose(stdout);
	return 0;
}
/*
10 3
3 3
5 7
2 8

*/