#include<bits/stdc++.h>
using namespace std;
int n, q;
int f[2000005];
int ans;
int sz[2000005];
int num0[2000005], num1[2000005];
void init(int now, int l, int r){
    sz[now] = 1;
    num0[now] = 1;
    if(l == r){
        return;
    }
    int mid = l+r>>1;
    init(now * 2, l, mid);
    init(now * 2 + 1, mid + 1, r);
    num0[now] += num0[now * 2];
    num0[now] += num0[now * 2 + 1];
    sz[now] += sz[now * 2];
    sz[now] += sz[now * 2 + 1];
}
void down(int now, int l, int r){
    if(f[now]){
        f[now * 2] ^= 1;
        f[now * 2 + 1] ^= 1;
        swap(num0[now * 2], num1[now * 2]);
        swap(num0[now * 2 + 1], num1[now * 2 + 1]);
        f[now] = 0;
    }
}
void change(int now, int l, int r, int x, int y){
    if(x <= l && r <= y){
        f[now] ^= 1;
        swap(num0[now], num1[now]);
        return;
    }
    down(now, l, r);
    int mid = l+r>>1;
    if(x <= mid)change(now * 2, l, mid, x, y);
    if(y > mid)change(now * 2 + 1, mid + 1, r, x, y);
    num0[now] = num0[now * 2] + num0[now * 2 + 1];
    num1[now] = num1[now * 2] + num1[now * 2 + 1];
    if(num0[now] == sz[now * 2] + sz[now * 2 + 1])num0[now]++;
    if(num1[now] == sz[now * 2] + sz[now * 2 + 1])num1[now]++;
}
signed main(){
    cin >> n >> q;
    init(1, 1, n);
    while(q--){
        int l, r;
        scanf("%d%d", &l, &r);
        change(1, 1, n, l, r);
        printf("%d\n", sz[1] - num0[1]);
    }
    return 0;
}