#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;


struct segtree {
  int N;
  vector<int> v,w,la;
  segtree() {}
  void init(int n, vector<int> &a, int k) {
    N=1;
    while(N<n) N<<=1;
    v=vector<int>(N*2,0);la=v;w=vector<int>(N*2,1);
    rep(i,a.size())v[i+N-1]=!!(a[i]&(1<<k));
    rrep(i,N-1) {
      w[i]=w[i*2+1]+w[i*2+2];
      v[i]=v[i*2+1]+v[i*2+2];
    }
  }
  void propagate(int p) {
    if(la[p]) {
      v[p]=w[p]-v[p];
      if(p<N-1) {la[p*2+1]=!la[p*2+1];la[p*2+2]=!la[p*2+2];}
      la[p]=0;
    }
  }
  void update(int l,int r) {update(l,r,0,N,0);}
  void update(int l,int r,int l2,int r2,int k) {
    if(r<=l2||r2<=l) {propagate(k);return;}
    if(l<=l2&&r2<=r) {la[k]=!la[k];propagate(k);return;}
    int m=(l2+r2)/2;propagate(k);
    update(l,r,l2,m,k*2+1);
    update(l,r,m,r2,k*2+2);
    v[k]=v[k*2+1]+v[k*2+2];
  }
  int sum(int l,int r) {return sum(l,r,0,N,0);}
  int sum(int l,int r,int l2,int r2,int k) {
    if(r<=l2||r2<=l) return 0;
    if(l<=l2&&r2<=r) {propagate(k);return v[k];}
    int m=(l2+r2)/2;propagate(k);
    int x=sum(l,r,l2,m,k*2+1),y=sum(l,r,m,r2,k*2+2);
    return x+y;
  }
};

segtree t;

void Main() {
  ll n,T;
  cin >> n >> T;
  vector<int> a(n,0);
  t.init(n,a,0);
  while(T--) {
    ll l,r;
    cin >> l >> r;
    t.update(l-1,r);
    pr(t.sum(0,n));
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}