#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#define maxn 100010
#define maxm 210
#define k 700
using namespace std;
int n,m,op,l,r,p,x,y;
int a[maxn],be[maxn],c[maxm][maxn],ks[maxm];
int sum=1,z=0,ans;
int main(){
    freopen("hsread.in","r",stdin); 
	freopen("hsread.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
    	z++;if(z>k)sum++,z=1;
    	if(z==1)ks[sum]=i;
    	be[i]=sum;
    	if(be[i]!=be[i-1]||a[i]!=a[i-1])
    	    for(int j=a[i];j<=n;j+=(j&-j))
    	        c[be[i]][j]++;
	}
	while(m--){
		scanf("%d",&op);
		if(op==1){
		    scanf("%d%d",&p,&x);
		    if(a[p]==x)continue;
			int a1=0,a2=0;
			if(be[p]!=be[p-1]||a[p]!=a[p-1])a1++;
			if(a[p]==a[p+1]&&be[p]==be[p+1])a1--;
			if(be[p]!=be[p-1]||a[p-1]!=x)a2++;
			if(be[p+1]==be[p]&&a[p+1]==x)a2--;
			if(a1!=0)for(int i=a[p];i<=n;i+=(i&-i))c[be[p]][i]-=a1;	
			if(a2!=0)for(int i=x;i<=n;i+=(i&-i))c[be[p]][i]+=a2;
			a[p]=x;			    
		}
		else{ans=0;
			scanf("%d%d%d%d",&l,&r,&x,&y);
			if(be[l]+1>=be[r]){
				for(int i=l;i<=r;i++){
					if(a[i]<x||a[i]>y)continue;
					if(a[i-1]!=a[i]||i==l)ans++;
				}
				printf("%d\n",ans);
				continue;
			}
			else{
				for(int i=be[l]+1;i<=be[r]-1;i++){
					for(int j=y;j;j-=(j&-j))ans+=c[i][j];
					for(int j=x-1;j;j-=(j&-j))ans-=c[i][j];
					int fz=ks[i];
					if(a[fz]==a[fz-1]&&a[fz]>=x&&a[fz]<=y)ans--;
				}
				int fz=ks[be[r]];
				if(a[fz]==a[fz-1]&&a[fz]>=x&&a[fz]<=y)ans--;
				for(int i=l;be[i]==be[l];i++){
					if(a[i]<x||a[i]>y)continue;
					if(a[i-1]!=a[i]||i==l)ans++;
				}
				for(int i=ks[be[r]];i<=r;i++){
					if(a[i]<x||a[i]>y)continue;
					if(a[i-1]!=a[i]||i==ks[be[r]])ans++;
				}
				printf("%d\n",ans);
			}
		}
	}
    return 0;
}