1 #include <bits/stdc++.h>
 2 inline void read(int &x)
 3 {
 4     x = 0;char ch = getchar();char c = ch;
 5     while(ch > '9' || ch < '0')c = ch, ch = getchar();
 6     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0',ch = getchar();
 7     if(c == '-')x = -x;
 8 }
 9 const int MAXN = 100000 + 10;
10 const int MAXM = 1000000 + 10;
11 inline void swap(int &a,int &b)
12 {
13     int tmp = a;
14     a = b;
15     b = tmp;
16 }
17
18 int stdata[MAXN << 2];int lazy[MAXN << 2];
19 //线段树存数字1的个数，lazy:0则不动， 1则反置
20
21 int n,m;
22
23 void putdown(int o, int l, int r)
24 {
25     int mid = (l + r) >> 1;
26     lazy[o << 1] ^= lazy[o];
27     lazy[o << 1 | 1] ^= lazy[o];
28     lazy[o] = 0;
29     stdata[o << 1] = (mid - l + 1) - stdata[o << 1];
30     stdata[o << 1 | 1] = (r - mid) - stdata[o << 1 | 1];
31 }
32
33 void modify(int ll, int rr, int o = 1, int l = 1, int r = n)
34 {
35     if(ll <= l && rr >= r)
36     {
37         stdata[o] = (r - l + 1) - stdata[o];
38         lazy[o] ^= 1;
39         return;
40     }
41     int mid = (l + r) >> 1;
42     if(lazy[o])putdown(o, l, r);
43     if(mid >= ll)modify(ll, rr, o << 1, l, mid);
44     if(mid < rr) modify(ll, rr, o << 1 | 1, mid + 1, r);
45     stdata[o] = stdata[o << 1] + stdata[o << 1 | 1];
46 }
47
48 int query(int ll, int rr, int o = 1, int l = 1, int r = n)
49 {
50     if(ll <= l && rr >= r)
51     {
52         return stdata[o];
53     }
54     int ans = 0;
55     int mid = (l + r) >> 1;
56     if(lazy[o]) putdown(o, l, r);
57     if(mid >= ll) ans += query(ll, rr, o << 1, l, mid);
58     if(mid < rr)ans += query(ll, rr, o << 1 | 1, mid + 1, r);
59     return ans;
60 }
61
62 int main()
63 {
64     read(n);read(m);
65     for(int i = 1;i <= m;i ++)
66     {
67         int tmp1,tmp2,tmp3;
68         read(tmp1);read(tmp2);read(tmp3);
69         if(tmp1 == 0)
70         {
71             modify(tmp2, tmp3);
72         }
73         else
74         {
75             printf("%d\n", query(tmp2, tmp3));
76         }
77     }
78     return 0;
79 }