#include <bits/stdc++.h>
using namespace std;
#define OPENIOBUF

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<16;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
};

class FastOutput final: public FastIOBase
{
 private:
	void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	void __write(T x)
	{
		char stk[numeric_limits<T>::digits10+1],*top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
	~FastOutput() { flush(); }
	void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
	FastOutput &operator <<(char x)
	{ return __putc(x),*this; }
	FastOutput &operator <<(const char *s)
	{ for(;*s;__putc(*(s++)));return *this; }
	FastOutput &operator <<(const std::string &s)
	{ return (*this)<<s.c_str(); }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(const T &x)
	{ return __write(x),*this; }
	template<typename ...T>
	void writesp(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	void writeln(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	template<typename Iter>
	void writesp(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<' '; }
	template<typename Iter>
	void writeln(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;

class FastInput final: public FastIOBase
{
 private:
	bool __eof;
 public:
	FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
	{ buf_p=BUFSIZE; }
	void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
	bool eof()const { return buf[buf_p]==EOF; }
#else
	{}
	bool eof()const { return feof(target); }
#endif
	char get()
	{
		if(__eof) return EOF;
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		char ch=buf[buf_p++];
#else
		char ch=getc(target);
#endif
		return ~ch?ch:(__eof=true,EOF);
	}
	void unget(char c)
	{
		__eof=false;
#ifdef OPENIOBUF
		buf[--buf_p]=c;
#else
		ungetc(c,target);
#endif
	}
	explicit operator bool()const { return !__eof; }
	FastInput &operator >>(char &x)
	{ while(isspace(x=get()));return *this; }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
	{
		char ch,sym=0;x=0;
		while(isspace(ch=get()));
		if(__eof) return *this;
		if(ch=='-') sym=1,ch=get();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
		return unget(ch),sym?x=-x:x,*this;
	}
	FastInput &operator >>(char *s)
	{
		while(isspace(*s=get()));
		if(__eof) return *this;
		for(;!isspace(*s) && !__eof;*(++s)=get());
		return unget(*s),*s='\0',*this;
	}
	FastInput &operator >>(std::string &s)
	{
		char str_buf[(1<<8)+1]={0},*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=get()));
		if(__eof) return *this;
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
			if(p!=buf_end) break;
			s.append(str_buf);
		}
		unget(*p),*p='\0',s.append(str_buf);
		return *this;
	}
	template<typename ...T>
	void read(T &...x)
	{ std::initializer_list<int>{(this->operator>>(x),0)...}; }
	template<typename Iter>
	void read(Iter begin,Iter end)
	{ while(begin!=end) (*this)>>*(begin++); }
}qin;

} // namespace FastIO
using FastIO::qin,FastIO::qout;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;
constexpr int INF=1e9;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) void()
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif

template<typename T,size_t MAXN>
class SmallVector
{
 private:
	char mem[MAXN*sizeof(T)];
	size_t n;
 public:
	using pointer=T*;
	using const_pointer=const T*;
	using reference=T&;
	using const_reference=const T&;
	using iterator=T*;
	using const_iterator=const T*;
	SmallVector(): mem{},n{} {}
	~SmallVector() { while(n) pop_back(); }
	SmallVector(const initializer_list<T> &ils): mem{},n{}
	{ for(auto &i: ils) push_back(i); }
	size_t size()const
	{ return n; }
	bool empty()const
	{ return !n; }
	reference back()
	{ return *(end()-1); }
	const_reference back()const
	{ return *(end()-1); }
	reference operator [](size_t i)
	{ return *static_cast<T*>(mem+i*sizeof(T)); }
	const_reference operator[](size_t i)const
	{ return *static_cast<const T*>(mem+i*sizeof(T)); }
	void push_back(const T &x)
	{ new(end()) T(x),n++; }
	template<typename ...Args>
	void emplace_back(Args &&...x)
	{ new(end()) T(forward<Args&&>(x)...),n++; }
	void pop_back()
	{ back().~T(),n--; }
	iterator begin()
	{ return static_cast<iterator>(static_cast<void*>(mem)); }
	iterator end()
	{ return static_cast<iterator>(static_cast<void*>(mem+n*sizeof(T))); }
	const_iterator begin()const
	{ return static_cast<const_iterator>(static_cast<const void*>(mem)); }
	const_iterator end()const
	{ return static_cast<const_iterator>(static_cast<const void*>(mem+n*sizeof(T))); }
};

struct Line
{
	int k,b;
	Line(): k{},b{} {}
	Line(int _b): k(0),b(_b) {}
	Line(int _k,int _b): k(_k),b(_b) {}
#define DEF_OP(op) \
	Line &operator op##=(const Line &rhs) \
	{ return k op##=rhs.k,b op##=rhs.b,*this; } \
	Line operator op(const Line &rhs)const \
	{ return Line(*this)op##=rhs; }
	DEF_OP(+) DEF_OP(-)
#undef DEF_OP
	Line operator -()const
	{ return Line(-k,-b); }
	int operator ()(int x)const
	{ return k*x+b; }
	Line operator ()(const Line &rhs)const
	{ return Line(k*rhs.k,k*rhs.b+b); }
	bool operator ==(const Line &rhs)const
	{ return k==rhs.k && b==rhs.b; }
};
struct Node
{
	Line A,B;
	Node(): A(1,0),B(0,0) {}
	Node(const Line &_A,const Line &_B): A(_A),B(_B) {}
	Node operator ()(const Node &rhs)const
	{ return Node(A(rhs.A),B(rhs.A)+rhs.B); }
	bool operator <(auto)const
	{ return false; }
	bool operator ==(const Node &rhs)const
	{ return A==rhs.A && B==rhs.B; }
};
class Func final: private SmallVector<pair<int,Node>,3>
{
 private:
	using BaseT=SmallVector<pair<int,Node>,3>;
 public:
	Func(): BaseT{} {}
	Func(const BaseT &vec): BaseT(vec) {}
	Func operator ()(const Func &rhs)const
	{
		Func res;
		auto add=[&](int k,auto &&x)
		{
			if(res.empty() || x!=res.back().second)
				res.emplace_back(k,x);
			else res.back().first=k;
		};
		int l=-INF,r;
		for(auto i=rhs.begin(),j=begin();i!=rhs.end();i++)
		{
			auto &f=i->second.A;
			r=i->first;
			int fl=f(l),fr=min(INF,f(r));
			while(j->first<fl) j++;
			do
			{
				int rr=i->first;
				if(f.k) rr=min(rr,j->first-f.b);
				add(rr,j->second(i->second));
			} while((j++)->first<fr);
			j--,l=r+1;
		}
		res.back().first=INF;
		return res;
	}
	Node operator ()(int x)const
	{
		auto it=lower_bound(begin(),end(),pair(x,Node{}));
		return it->second;
	}
};

const Line _X(1,0);
const Func E({{INF,Node(_X,0)}}),
		   F1({{INF,Node(_X+1,1)}}),
		   F2({{0,Node(-INF,-1)},{INF,Node(_X-1,-1)}}),
		   F3({{-1,Node(0,0)},{INF,Node(_X,0)}}),
		   F4({{-1,Node(-INF,0)},{INF,Node(-INF,-_X)}});

int n,q;
struct TreeNode{ bool ise;Func f;}t[2000005];
#define LC (i<<1)
#define RC (i<<1|1)
void build(int l,int r,int i=1)
{
	t[i]=TreeNode{true,E};
	if(l==r) return;
	int mid=(l+r)>>1;
	build(l,mid,LC),build(mid+1,r,RC);
}
inline void pushTag(int i,const Func &f)
{
	t[i].ise=false;
	t[i].f=f(t[i].f);
}
inline void pushdown(int i)
{
	if(t[i].ise) return;
	pushTag(LC,t[i].f),pushTag(RC,t[i].f);
	t[i].f=E,t[i].ise=true;
}
void modify(int lq,int rq,const Func &f,int i=1,int l=1,int r=n)
{
	if(l>=lq && r<=rq) return pushTag(i,f);
	int mid=(l+r)>>1;
	pushdown(i);
	if(mid>=lq) modify(lq,rq,f,LC,l,mid);
	if(mid<rq) modify(lq,rq,f,RC,mid+1,r);
}
Func query(int p,int i=1,int l=1,int r=n)
{
	if(l==r) return t[i].f;
	int mid=(l+r)>>1;
	Func res=(mid>=p?query(p,LC,l,mid):query(p,RC,mid+1,r));
	return t[i].ise?res:t[i].f(res);
}

int main()
{
	qin>>n>>q;
	build(1,n);
	while(q--)
	{
		int opt,l,r;
		qin>>opt>>l>>r;
		if(opt==1) modify(l,r,F1);
		else if(opt==2) modify(l,r,F2);
		else if(opt==3) modify(l,r,F3);
		else if(opt==4) modify(l,r,F4);
		else qout<<(500000+query(l)(-INF).B(0))<<'\n';
	}
	return 0;
}