/*
作者:zbtrs
题目:p1690 开关灯
*/
#include <iostream>  
#include <cstdlib>  
#include <cstdio>  
#include <cstring>  
#include <string>  
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

int n, m,d1[500010],add[500010],d2[500010];

void pushup(int o)
{
    d1[o] = d1[o * 2] + d1[o * 2 + 1]; //关
    d2[o] = d2[o * 2] + d2[o * 2 + 1]; //开
}

void pushdown(int o, int l, int r)
{
    if (add[o] % 2 == 1)
    {
        add[o * 2] += add[o];
        add[o * 2 + 1] += add[o];
        add[o] = 0;
        swap(d1[o * 2], d2[o * 2]);
        swap(d1[o * 2 + 1], d2[o * 2 + 1]);
    }
}

void build(int o, int l, int r)
{
    if (l == r)
    {
        d1[o] = r - l + 1;
        return;
    }
    int mid = (l + r) >> 1;
    build(o * 2, l, mid);
    build(o * 2 + 1, mid + 1, r);
    pushup(o);
}

void update(int o, int l, int r, int x, int y)
{
    if (x <= l && r <= y)
    {
        swap(d1[o], d2[o]);
        add[o]++;
        return;
    }
    pushdown(o, l, r);
    int mid = (l + r) >> 1;
    if (x <= mid)
        update(o * 2, l, mid, x, y);
    if (y > mid)
        update(o * 2 + 1, mid + 1, r, x, y);
    pushup(o);
}

int query(int o, int l, int r, int x, int y)
{
    if (x <= l && r <= y)
        return d2[o];
    pushdown(o, l, r);
    int mid = (l + r) >> 1,cnt = 0;
    if (x <= mid)
        cnt += query(o * 2, l, mid, x, y);
    if (y > mid)
        cnt += query(o * 2 + 1, mid + 1, r, x, y);
    pushup(o);
    return cnt;
}

int main()
{
    scanf("%d%d", &n, &m);
    build(1, 1, n);
    for (int i = 1; i <= m; i++)
    {
        int id, x, y;
        scanf("%d%d%d", &id, &x, &y);
        if (id == 0)
            update(1, 1, n, x, y);
        if (id == 1)
            printf("%d\n", query(1, 1, n, x, y));
    }

    return 0;
}