#include<bits/stdc++.h>
using namespace std;
const int N=100010;
const int M=1e6+100;
int color[N];
int h[M],ne[N],e[N],idx,p[M];
int ans;
int siz[M];
void add(int a,int b){
e[idx]=b,ne[idx]=h[a],h[a]=idx++;
siz[a]++;
}
void merge(int &a,int &b){
if(a==b) return ;
if(siz[a]>siz[b]) swap(a,b);
for(int i=h[a];i!=-1;i=ne[i]){
int j=e[i];
ans-=(color[j-1]==b)+(color[j+1]==b);
}
for(int i=h[a];i!=-1;i=ne[i]){
int j=e[i];
color[j]=b;
if(ne[i]==-1){
ne[i]=h[b];
h[b]=h[a];
break;
}
}
h[a]=-1;
siz[b]+=siz[a],siz[a]=0;
}
int main(){
memset(h,-1,sizeof h);
int n,m;scanf("%d%d",&n,&m);
for(int i=0;i<M;i++) p[i]=i;
for(int i=1;i<=n;i++){
scanf("%d",&color[i]);
if(color[i]!=color[i-1]) ans++;
add(color[i],i);
}
while(m--){
int op;scanf("%d",&op);
if(op==1){
int x,y;scanf("%d%d",&x,&y);
merge(p[x],p[y]);
}
else printf("%d\n",ans);
}
return 0;
}