#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
int main(){
  ll N,Q;cin>>N>>Q;
  set<pi>S;
  while(Q--){
  	ll t;cin>>t;
  	if(t==1){
  		ll L,R;cin>>L>>R;L--;R--;
  		auto s=S.upper_bound(pi(L,1e18));
  		if(s!=S.begin()){s--;if((*s).S>=L)L=(*s).F;else s++;}
  		vector<pi>P;
  		while(s!=S.end()&&((*s).F)<=R){
  			chmax(R,(*s).S);
  			P.emplace_back(*s);
  			s++;
  		}
  		//cout<<P<<endl;
  		for(auto p:P)S.erase(p);
  		S.insert(pi(L,R));
  	}
  	else if(t==2){
  		ll L,R;cin>>L>>R;L--;R--;
  		auto t=S.upper_bound(pi(L,1e18));
  		if(t!=S.begin()){
  			t--;
  			if((*t).S>L){
  				auto p=*t;
  				if(p.S>=R){
  					S.insert(pi(p.F,L));
  					S.insert(pi(R,p.S));
  					S.erase(t);
  					continue;
  				}
  				p.S=L;
  				S.erase(t);
  				S.insert(p);
  			}
  		}
  		t=S.upper_bound(pi(L,1e18));
  		vector<pi>P;
  		while(t!=S.end()&&(*t).S<R){
  			P.emplace_back(*t);t++;
  		}
  		if(t!=S.end()&&(*t).F<R){
  			auto p=*t;
  			p.F=R;
  			S.erase(t);
  			S.insert(p);
  		}
  		for(auto p:P)S.erase(p);
  	}
  	else if(t==3){
  		ll u,v;cin>>u>>v;u--;v--;
  		if(u==v){cout<<1<<endl;continue;}
  		if(u>v)swap(u,v);
  		auto t=S.upper_bound(pi(v,1e18));
  		if(t==S.begin()){cout<<0<<endl;continue;}
  		t--;
  		if((*t).S>=v&&(*t).F<=u)cout<<1<<endl;
  		else cout<<0<<endl;
  	}
  	else{
  		ll v;cin>>v;v--;
  		auto t=S.upper_bound(pi(v,1e18));
  		if(t==S.begin()){cout<<1<<endl;continue;}
  		t--;
  		if((*t).S>=v)cout<<(*t).S-(*t).F+1<<endl;
  		else cout<<1<<endl;
  	}
  	//for(auto p:S)cout<<"("<<p.F<<","<<p.S<<") ";cout<<endl;
  }
  return 0;
}