#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

char op(char x, char y) { return x & y; }
char e() { return true; }
int composition(int f, int g) {
  if (f != -1) return f;
  else return g;
}
int id() { return -1; }
char mapping(int f, char x) { return f != -1 ? f : x; }

template <class S>
struct value_compression : vector<S> {
  bool built = false;
  using VS = vector<S>;
  using VS::VS;
  value_compression(vector<S> v) : vector<S>(move(v)) {}
  void build() {
    sort(this->begin(), this->end());
    this->erase(unique(this->begin(), this->end()), this->end());
    built = true;
  }
  template <class T>
  void convert(T first, T last) {
    assert(built);
    for (; first != last; ++first) *first = (*this)(*first);
  }
  int operator()(S x) {
    assert(built);
    return lower_bound(this->begin(), this->end(), x) - this->begin();
  }
  void clear() {
    this->clear();
    built = false;
  }
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vector<tuple<int, int, int>> qs(q);
  value_compression<int> vc{0, 1001001001};
  for(auto& [t, i0, i1] : qs) {
    cin >> t;
    if (t == 1 || t == 2) {
      cin >> i0 >> i1;
      vc.emplace_back(i0);
      vc.emplace_back(i1);
    } else if (t == 3) {
      cin >> i0 >> i1;
      if (i0 > i1) swap(i0, i1);
      vc.emplace_back(i0);
      vc.emplace_back(i1);
    } else {
      cin >> i0;
      vc.emplace_back(i0);
    }
  }
  vc.build();
  int sz = vc.size();
  lazy_segtree<char, op, e, int, mapping, composition, id> seg(vector<char>(sz, 0));
  for(auto [t, i0, i1] : qs) {
    if (t == 1) {
      seg.apply(vc(i0), vc(i1), true);
    } else if (t == 2) {
      seg.apply(vc(i0), vc(i1), false);
    } else if (t == 3) {
      cout << int(seg.prod(vc(i0), vc(i1))) << '\n';
    } else {
      int i = vc(i0);
      int l = seg.min_left(i, [](char x) { return x; });
      int r = seg.max_right(i, [](char x) { return x; });
      cout << vc[r] - vc[l] + 1 << '\n';
    }
  }
}