#include<bits/stdc++.h>
using namespace std;
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef unsigned long long ull;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=100100,M=N*10;
struct BIT
{
	int n,tr[N];
	il void Clear(const int &_) { n=_; rep(i,1,n) tr[i]=0; }
	il void Add(int x) { while(x<=n) ++tr[x],x+=x&(-x); }
	il void Del(int x) { while(x<=n) --tr[x],x+=x&(-x); }
	il int Sum(int x) { int sum=0; while(x) sum+=tr[x],x^=x&(-x); return sum; }
};
BIT bit;

struct node { int l,r,v; };
il bool operator <(const node &X,const node &Y) { return X.l<Y.l; }

struct que { int x,y,z; };
que q[M]; int qcnt,p[M],tmp[M];

using iter=set<node>::iterator;
set<node> odt,st[N<<1];
int pre[N]; set<int> cand;

int n;
il iter Split(const int &x)
{
	iter it=odt.lower_bound((node){x,0,0});
	if(it!=odt.end()&&(it->l)==x) return it;
	--it; int l=it->l,r=it->r,v=it->v;
	st[v].erase((node){l,r,v}),odt.erase((node){l,r,v});
	st[v].insert((node){l,x-1,v}),odt.insert((node){l,x-1,v});
	return st[v].insert((node){x,r,v}),odt.insert((node){x,r,v}).fi;
}
il void Modify(const int &l,const int &r,const int &x)
{
	iter R=Split(r+1),L=Split(l),it,it2;
	for(it=L; it!=R; ++it)
	{
		cand.insert(it->l),it2=st[it->v].upper_bound((node){it->l,0,0});
		if(it2!=st[it->v].end()) cand.insert(it2->l);
		st[it->v].erase((node){it->l,it->r,it->v});
	}
	odt.erase(L,R),odt.insert((node){l,r,x}),it2=st[x].insert((node){l,r,x}).fi;
	if(next(it2)!=st[x].end()) cand.insert(next(it2)->l);
	int tmp=pre[l];
	(it2==st[x].begin())? pre[l]=0:pre[l]=prev(it2)->r;
	if(pre[l]!=tmp)
		q[++qcnt]=(que){tmp,l,-1},q[++qcnt]=(que){pre[l],l,0};
	cand.erase(cand.begin());
	for(int i:cand)
	{
		tmp=pre[i];
		if(i<=r)
			pre[i]=i-1;
		else
		{
			it=odt.lower_bound((node){i,0,0});
			if((it->l)==i)
			{
				it2=st[it->v].lower_bound((node){it->l,0,0});
				(it2==st[it->v].begin())? pre[i]=0:pre[i]=prev(it2)->r;
			}
			else
				pre[i]=i-1;
		}
		if(pre[i]!=tmp)
			q[++qcnt]=(que){tmp,i,-1},q[++qcnt]=(que){pre[i],i,0};
	}
	cand.clear();
}

int ans[N];
il void cdq(const int &l,const int &r)
{
	if(l==r) return;
	int mid=(l+r)>>1;
	cdq(l,mid),cdq(mid+1,r);
	int I=l,J=mid+1,K=l;
	while(I<=mid&&J<=r)
	{
		if(q[p[I]].x<=q[p[J]].x)
		{
			if(!(~q[p[I]].z))
				bit.Del(q[p[I]].y);
			if(!q[p[I]].z)
				bit.Add(q[p[I]].y);
			tmp[K++]=p[I++];
		}
		else
		{
			if(q[p[J]].z>0)
				ans[q[p[J]].z]+=bit.Sum(q[p[J]].y);
			tmp[K++]=p[J++];
		}
	}
	while(I<=mid)
	{
		if(!(~q[p[I]].z))
			bit.Del(q[p[I]].y);
		if(!q[p[I]].z)
			bit.Add(q[p[I]].y);
		tmp[K++]=p[I++];
	}
	while(J<=r)
	{
		if(q[p[J]].z>0)
			ans[q[p[J]].z]+=bit.Sum(q[p[J]].y);
		tmp[K++]=p[J++];
	}
	rep(i,l,mid)
	{
		if(!(~q[p[i]].z))
			bit.Add(q[p[i]].y);
		if(!q[p[i]].z)
			bit.Del(q[p[i]].y);
	}
	rep(i,l,r)
		p[i]=tmp[i];
}

int m,op,l,r,x;
bitset<N> flag;
map<int,int> mp; int ccnt;
il void Solve()
{
	cin>>n>>m,bit.Clear(n);
	rep(i,1,n+1)
	{
		(i<=n)? (cin>>x,x=((!mp.count(x))? (mp[x]=++ccnt):mp[x])):x=0;
		odt.insert((node){i,i,x}),st[x].insert((node){i,i,x});
		iter it=st[x].lower_bound((node){i,i,x});
		(it==st[x].begin())? pre[i]=0:pre[i]=prev(it)->r;
		q[++qcnt]=(que){pre[i],i,0};
	}
	rep(i,1,m)
	{
		cin>>op;
		if(op==1)
			cin>>l>>r>>x,x=((!mp.count(x))? (mp[x]=++ccnt):mp[x]),Modify(l,r,x);
		if(op==2)
			cin>>l>>r,q[++qcnt]=(que){l-1,r,i},ans[i]=1-l,flag[i]=1;
	}
	rep(i,1,qcnt)
		p[i]=i;
	cdq(1,qcnt);
	for(int i=flag._Find_first(); i<=m; i=flag._Find_next(i))
		cout<<ans[i]<<'\n';
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	int T=1;
	while(T--)
		Solve();
	return 0;
}