#include <bits/stdc++.h>
using namespace std;
int inf_int = 2e9;
long long inf_ll = 2e18;
const double pi = 3.1415926535898;
template <typename T, typename T1>
void prin(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
template <typename T>
void prin(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i];
    if (i < a.size() - 1)
      cout << " ";
    else
      cout << "\n";
  }
}
template <typename T>
void prin(set<T>& a) {
  for (auto it = a.begin(); it != a.end(); it++) {
    cout << *it << " ";
  }
}
template <typename T>
void prin_new_line(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << "\n";
  }
}
template <typename T, typename T1>
void prin_new_line(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
int sum_vec(vector<int>& a) {
  int s = 0;
  for (int i = 0; i < a.size(); i++) {
    s += a[i];
  }
  return s;
}
template <typename T>
T max(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = max(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = min(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
long double s_triangle(long double x1, long double y1, long double x2,
                       long double y2, long double x3, long double y3) {
  return abs(((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1)) / 2);
}
bool overflow(long long a, long long b) {
  if (a * b / b != a) return true;
  return false;
}
bool debug = 0;
const int maxn = 1e5;
long long mod = 777777777;
vector<int> a;
vector<int> t(4 * maxn);
void update(int v, int tl, int tr, int pos, bool uvel) {
  if (tl == tr) {
    if (uvel) {
      t[v]++;
    } else {
      t[v]--;
    }
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm) {
      update(v << 1, tl, tm, pos, uvel);
    } else {
      update(v << 1 | 1, tm + 1, tr, pos, uvel);
    }
    t[v] = t[v << 1] + t[v << 1 | 1];
  }
}
int get(int v, int tl, int tr, int l, int r) {
  if (l > r) return 0;
  if (tl == l && tr == r) {
    return t[v];
  } else {
    int tm = (tl + tr) >> 1;
    return get(v << 1, tl, tm, l, min(r, tm)) +
           get(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r);
  }
}
void solve() {
  int n, q;
  cin >> n >> q;
  set<pair<int, pair<int, int> > > s;
  s.insert({n, {1, n}});
  map<int, pair<int, int> > fin, st;
  fin[n] = {1, n};
  st[1] = {1, n};
  map<int, int> cnt;
  map<int, int> mp;
  vector<pair<char, pair<int, int> > > b;
  for (int i = 0; i < q; i++) {
    int t;
    cin >> t;
    if (t == 0) {
      int l, r;
      cin >> l >> r;
      b.push_back({'g', {l, r}});
    } else {
      if (mp[t]) {
        int pos = mp[t];
        int l = pos, r = pos;
        if (st[pos + 1] != make_pair(0, 0)) {
          r = st[pos + 1].second;
          s.erase({r - pos, {pos + 1, r}});
          if (debug)
            cout << "erase "
                 << " " << r - pos << " " << pos + 1 << " " << r << endl;
          st[pos + 1] = {0, 0};
          fin[r] = {0, 0};
        }
        if (fin[pos - 1] != make_pair(0, 0)) {
          l = fin[pos - 1].first;
          s.erase({pos - l, {l, pos - 1}});
          if (debug)
            cout << "erase "
                 << " " << pos - l << " " << l << " " << pos - 1 << endl;
          st[l] = {0, 0};
          fin[pos - 1] = {0, 0};
        }
        st[l] = {l, r};
        fin[r] = {l, r};
        s.insert({r - l + 1, {l, r}});
        if (debug)
          cout << "add "
               << " " << r - l + 1 << " " << l << " " << r << endl;
        mp[t] = 0;
        b.push_back({'r', {pos, pos}});
      } else {
        auto it = s.end();
        it--;
        int len = it->first;
        int l = it->second.first, r = it->second.second;
        if (debug)
          cout << "big "
               << " " << len << " " << l << " " << r << endl;
        int pos;
        if (len % 2 == 1) {
          pos = (l + r) >> 1;
        } else {
          pos = ((l + r) >> 1) + 1;
        }
        if (debug) cout << pos << endl;
        mp[t] = pos;
        s.erase(it);
        fin[r] = {0, 0};
        st[l] = {0, 0};
        if (pos - 1 >= l) {
          s.insert({pos - l, {l, pos - 1}});
          fin[pos - 1] = {l, pos - 1};
          st[l] = {l, pos - 1};
          if (debug)
            cout << "add " << pos - l << " " << l << " " << pos - 1 << endl;
        }
        if (r >= pos + 1) {
          s.insert({r - pos, {pos + 1, r}});
          fin[r] = {pos + 1, r};
          st[pos + 1] = {pos + 1, r};
          if (debug)
            cout << "add " << r - pos << " " << pos + 1 << " " << r << endl;
        }
        a.push_back(pos);
        b.push_back({'a', {pos, pos}});
      }
      cnt[t]++;
    }
  }
  sort(a.begin(), a.end());
  a.resize(distance(a.begin(), unique(a.begin(), a.end())));
  n = a.size();
  for (int i = 0; i < b.size(); i++) {
    if (b[i].first == 'g') {
      int l = distance(a.begin(),
                       lower_bound(a.begin(), a.end(), b[i].second.first));
      int r = distance(a.begin(),
                       upper_bound(a.begin(), a.end(), b[i].second.second));
      r--;
      cout << get(1, 0, n - 1, l, r) << "\n";
    } else if (b[i].first == 'a') {
      int x = distance(a.begin(),
                       lower_bound(a.begin(), a.end(), b[i].second.first));
      update(1, 0, n - 1, x, 1);
    } else {
      int x = distance(a.begin(),
                       lower_bound(a.begin(), a.end(), b[i].second.first));
      update(1, 0, n - 1, x, false);
    }
  }
}
int main() {
  if (!debug) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int t = 1;
  while (t--) solve();
  return 0;
}
