#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #define LL long long

 #define rg register

 #define N 200010

 #define ls (u<<1)

 #define rs (u<<1|1)

 #define mid ((a[u].l+a[u].r)>>1)

 #define len(x) (a[x].r-a[x].l+1)

 using namespace std;

 int n,m;

 struct tree{

     int l,r,sum,mark;

 }a[N<<];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 void build(int u,int l,int r){

     a[u].l=l; a[u].r=r;

     if(l<r) build(ls,l,mid),build(rs,mid+,r);

 }

 inline void pushdown(int u){

     a[u].mark^=;

     a[ls].mark^=; a[ls].sum=len(ls)-a[ls].sum;

     a[rs].mark^=; a[rs].sum=len(rs)-a[rs].sum;

 }

 void update(int u,int r,int l){

     if(l<=a[u].l&&a[u].r<=r){

         a[u].mark^=;

         a[u].sum=len(u)-a[u].sum;

         return;

     }

     if(a[u].mark) pushdown(u);

     if(l<=mid) update(ls,r,l);

     if(r>mid) update(rs,r,l);

     a[u].sum=a[ls].sum+a[rs].sum;

 }

 int query(int u,int r,int l){

     if(l<=a[u].l&&a[u].r<=r) return a[u].sum;

     if(a[u].mark) pushdown(u);

     int ret=;

     if(l<=mid) ret+=query(ls,r,l);

     if(r>mid) ret+=query(rs,r,l);

     return ret;

 }

 int main(){

     n=read(); m=read(); build(,,n);

     while(m--){

         int opt=read();

         if(opt) printf("%d\n",query(,read(),read()));

         else update(,read(),read());

     }

     return ;

 }