#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 200010
#define ll long long
#define fmid (l+r)>>1
#define lson l,mid,p<<1
#define rson mid+1,r,p<<1|1
using namespace std;
int tree[N<<2],h[N<<2];
void build(int l,int r,int p){
	if(l==r){
		tree[p]=1;
		return ;
	}
	int mid=fmid;
	build(lson),build(rson);
	tree[p]=tree[p<<1]+tree[p<<1|1];
	return ;
}
void push_down(int l,int r,int p){
	if(h[p]){
		h[p<<1]=h[p<<1|1]=h[p];
		tree[p<<1]=tree[p<<1|1]=0;
		h[p]=0;
	}
	return ;
}
void update(int l,int r,int p,int kl,int kr){
	if(l>=kl && r<=kr){
		h[p]++;
		tree[p]=0;
		return ;
	}
	push_down(l,r,p);
	int mid=fmid;
	if(kl<=mid) update(lson,kl,kr);
	if(kr>mid) update(rson,kl,kr);
	tree[p]=tree[p<<1]+tree[p<<1|1];
	return ;
}
int main(){
	freopen("axis.in","r",stdin);
	freopen("axis.out","w",stdout); 
	int n,m,i,l,r;
	scanf("%d%d",&n,&m);
	build(1,n,1);
	while(m--){
		scanf("%d%d",&l,&r);
		update(1,n,1,l,r);
		printf("%d\n",tree[1]);
	}
	return 0;
}