#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define int long long
#define x first
#define y second
#define ps push_back
#define endl '\n'

#define kd                     \
  ios::sync_with_stdio(false); \
  cin.tie(0);                  \
  cout.tie(0);
using namespace std;
typedef pair<int, int> pi;
const int N = 1e5 + 100, mod = 1e9 + 7, INF = 1e10;
int lowbit(int x) { return x & -x; }
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }

int tr[3][N];
int n;
void add(int x, int id, int c) {
  for (int i = x; i <= n; i += lowbit(i)) tr[id][i] += c;
}

int get(int x, int id) {
  int res = 0;
  for (int i = x; i; i -= lowbit(i)) res += tr[id][i];
  return res;
}

void solve() {
  int m;
  while (cin >> n >> m) {
    for (int i = 1; i <= n; i++)
      for (int j = 0; j <= 2; j++) tr[j][i] = 0;

    while (m--) {
      int op;
      cin >> op;
      if (op == 1) {
        int l, r;
        cin >> l >> r;
        add(l, 0, 1);
        add(r + 1, 0, -1);
        if (r - l >= 1) {
          add(l, 1, 1);
          add(r, 1, -1);
        }
        if (r - l >= 2) {
          add(l, 2, 1);
          add(r - 1, 2, -1);
        }
      } else {
        int l, r;
        cin >> l >> r;
        cout << get(l, r - l) << endl;
      }
    }
  }
}

signed main() {
  kd;
  int _;
  _ = 1;
  // cin>>_;
  while (_--) solve();
  return 0;
}