#include<bits/stdc++.h>
using namespace std;
struct node{
	int lazy=0;int l,r,num0,num1;
	void add(){
		lazy^=1,swap(num0,num1);
	}
}tree[2000005];int tot =0 ;
void push_down(int k){
	if(tree[k].lazy){
		tree[k<<1].add();tree[k<<1|1].add();tree[k].lazy = 0;
	}
}
void push_up(int k){
	tree[k].num0 = tree[k<<1].num0+tree[k<<1|1].num0+(tree[k<<1].num1 ==0 and tree[k<<1|1].num1 == 0);
	tree[k].num1 = tree[k<<1].num1+tree[k<<1|1].num1+(tree[k<<1].num0 ==0 and tree[k<<1|1].num0 == 0);
}void build(int l,int r,int k){
	tree[k].l = l,tree[k].r = r;++tot;
	if(l == r){
		tree[k].num0 = 1,tree[k].num1 =0 ;return;
	}int mid = l+r>>1;
	build(l,mid,k<<1),build(mid+1,r,k<<1|1);push_up(k);
}void upd(int l,int r,int k){
	int ll=  tree[k].l,rr = tree[k].r;
	if(ll>r or l>rr)return ;
	if(l<=ll and rr<=r){
		tree[k].add();return;
	}push_down(k);upd(l,r,k<<1),upd(l,r,k<<1|1);push_up(k);
}int n,q;
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> q;
	build(1,n,1);
//	cout << tot << endl;
//cout << tree[1].num0 << endl;
	while(q--){
		int l,r;cin >> l >> r;upd(l,r,1);
		cout << tot-tree[1].num0 << '\n';
	}
	return 0;
}/*
这题真牛。
*/