#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/lazysegtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const int inf = 1e9;

int op(int x, int y){
    return min(x, y);
}

int e(){
    return inf;
}

int id(){
    return -1;
}

int mapping(int f, int x){
    if(f == id()) return x;
    return f;
}

int composition(int f, int g){
    if(f == id()) return g;
    return f;
}

template<typename T>
class Compress{
    public:
    vector<T> data;
    int offset;
    Compress(vector<T> data_, int offset=0): offset(offset){
        data = data_;
        sort(begin(data), end(data));
        data.erase(unique(begin(data), end(data)), end(data));
    };
    int operator[](T x) {
        auto p = lower_bound(data.begin(), data.end(), x);
        assert(x == *p);
        return offset+(p-data.begin());
	}
    T inv(int x){
        return data[x-offset];
    }
    int size(){
        return data.size();
    }
};

using Seg = atcoder::lazy_segtree<int, op, e, int, mapping, composition, id>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, q; cin >> n >> q;
    vector<int> t(q), l(q), r(q);
    vector<int> v;
    for(int i = 0; i < q; i++){
        cin >> t[i];
        if(t[i] != 4){
            cin >> l[i] >> r[i]; l[i]--; r[i]--;
            if(l[i] > r[i]) swap(l[i], r[i]);
            v.push_back(l[i]);
            v.push_back(r[i]);
        }else{
            cin >> l[i]; l[i]--;
            v.push_back(l[i]);
        }
    }
    auto cp = Compress<int>(v);
    int m = cp.size();
    for(int i = 0; i < q; i++){
        if(t[i] != 4){
            l[i] = cp[l[i]];
            r[i] = cp[r[i]];
        }else{
            l[i] = cp[l[i]];
        }
    }
    Seg seg(vector<int>(m-1, 0));
    for(int i = 0; i < q; i++){
        if(t[i] == 1){
            seg.apply(l[i], r[i], 1);
        }else if(t[i] == 2){
            seg.apply(l[i], r[i], 0);
        }else if(t[i] == 3){
            if(seg.prod(l[i], r[i]) == 0){
                cout << 0 << endl;
            }else{
                cout << 1 << endl;
            }
        }else{
            auto g = [&](int x){
                return x >= 1;
            };
            int r0 = seg.max_right(l[i], g);
            int l0 = seg.min_left(l[i], g);
            cout << cp.data[r0]-cp.data[l0]+1 << endl;
        }
    }
}