#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 5;
int w[maxn * 4], a[maxn], lazy[maxn * 4];
void build(const int u, int L, int R){
    if(L == R) w[u] = a[L];
    else {
        int M = (L + R) / 2;
        build(u * 2, L, M);
        build(u * 2 + 1, M + 1, R);
    }
    return;
}
void maketag(int u, int len){
    lazy[u] ^= 1;
    w[u] = len - w[u];
}
void pushdown(int u, int L, int R){
    int M = (L + R) / 2;
    maketag(u * 2, M - L + 1);
    maketag(u * 2 + 1, R - M);
    //lazy[u] = 0;
}
int query(int u, int L, int R, int l, int r){
    if(L >= l && R <= r) return w[u];
    else if(!(R < l || L > r)){
        int M = (L + R) / 2;
        pushdown(u, L, R);
        return query(u * 2, L, M, l, r) + query(u * 2 + 1, M + 1, R, l, r);
    }else return 0;
}
void update(int u, int L, int R, int l, int r){
    if(L >= l && R <= r) maketag(u, R - L + 1);
    else if(!(R < l || L > r)){
        int M = (L + R) / 2;
        pushdown(u, L, R);
        update(u * 2, L, M, l, r);
        update(u * 2 + 1, M + 1, R, l, r);
        w[u] = w[u * 2] + w[u * 2 + 1];
    }
}
int main(){
    int n, m;
    cin >> n >> m;
    build(1, 1, n);
    for(int i = 1; i <= m; i++){
        int op, x, y;
        cin >> op >> x >> y;
        if(op == 0){
            update(1, 1, n, x, y);
        }else if(op == 1){
            cout << query(1, 1, n, x, y) << endl;
        }
    }
    return 0;
}