#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
#include<map>
#define int long long
#define i128 __int128
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int N = 2e5 + 10;
const long long l = 1e18+10;
int pos[N], L[N], R[N], sum[N], add[N], t;
bool d[N];
void pp(int l, int r) {
	int p = pos[l];
	int q = pos[r];

	if (p == q)  //同一个块中
	{
		for (int i = l; i <= r; i++)
		{
			sum[p] += d[i] == 0 ? 1 : -1;
			d[i] ^= 1;
		}
	}
	else {

		for (int i = p + 1; i <= q - 1; i++)  add[i] += 1;

		for (int i = l; i <= R[p]; i++)
		{
			sum[p] += d[i] == 0 ? 1 : -1;
			d[i] ^= 1;
		}

		for (int i = L[q]; i <= r; i++)
		{
			sum[q] += d[i] == 0 ? 1 : -1;
			d[i] ^= 1;
		}

	}
}
int query(int l, int r)
{
	int p = pos[l];
	int q = pos[r];
	int ans = 0;
	if (p == q) {
		for (int i = l; i <= r; i++)
		{
			if (add[i] % 2 == 0) ans += d[i];
			else ans += (d[i] ^ 1);
		}
	}
	else {

		for (int i = l; i <= R[p]; i++)
		{
			if (add[i] % 2 == 0) ans += d[i];
			else ans += (d[i] ^ 1);
		}

		for (int i = L[q]; i <= r; i++)
		{
			if (add[i] % 2 == 0) ans += d[i];
			else ans += (d[i] ^ 1);
		}

		for (int i = p + 1; i <= q - 1; i++) 
		{
			if (add[i] % 2 == 0) ans += sum[i];
			else ans += t - sum[i];
		}
	}

	return ans;

}
void tackle()
{
	int n, m;

	cin >> n >> m;

	t = sqrt(n);

	for (int i = 1; i <= t; i++)
		L[i] = (i - 1) * t + 1, R[i] = i * t;
	
	if (R[t] < n) ++t, L[t] = R[t - 1] + 1 , R[t] = n;

	for (int i = 1; i <= t; i++)
		for (int j = L[i]; j <= R[i]; j++)
			pos[j] = i;


	while (m--)
	{	
		int a, b, c;
		cin >> a >> b >> c;
		if (a == 0) pp(b, c);
		else cout << query(b, c) << '\n';
	}


}
signed main()
{
	int K;
	K = 1;
	//cin >> K;

	while (K--)
	{
		tackle();
	}

	return 0;
}