#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=200000+10;
int duxi[maxn*4];
int n,m;
void modify(int k, int x, int y, int l, int r)
{
if (r<x || l>y) return;
if ((y-x+1==duxi[k]) || (l<=x && r>=y))
{
duxi[k]=y+1-x;
return;
}
int m=x+(y-x)/2;
modify(2*k,x,m,l,r);
modify(2*k+1,m+1,y,l,r);
duxi[k]=duxi[2*k]+duxi[2*k+1];
}
void init()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void readdata()
{
memset(duxi, 0, sizeof(duxi));
int x,y;
scanf("%d%d", &n, &m);
for (int i=1; i<=m; i++)
{
scanf("%d%d", &x, &y);
modify(1,1,n,x,y);
printf("%d\n", n-duxi[1]);
}
}
void work()
{
}
int main()
{
init();
readdata();
work();
return 0;
}