#include <cstdio>
#include <iostream>
#include <algorithm> 
#define N 100005
#define M 1000005
using namespace std;
int n,m,cnt,ans;
int c[N],nxt[N],ft[M],head[M],s[M],st[M],w[N],h[N];
inline int lb(int i) {return i&(-i);}
inline int qry(int *arr,int pos) {
    int ans=0; for (;pos;pos-=lb(pos)) ans+=arr[pos]; return ans;
}
inline int mdf(int *arr,int pos,int key) {
    for (;pos<=n;pos+=lb(pos)) arr[pos]+=key;
}
void solve(int a,int b)
{
    for(int i=head[a];i;i=nxt[i])
    {
        if(c[i+1]==b) mdf(w,i+1,-1),h[i+1]=0;
        if(c[i-1]==b) mdf(w,i,-1),h[i]=0;
    }
    for(int i=head[a];i;i=nxt[i])c[i]=b;
    nxt[st[a]]=head[b];head[b]=head[a];s[b]+=s[a];
    head[a]=st[a]=s[a]=0;
}
int main()
{
    int T,x,a,b;
    scanf("%d",&T);
    while (T--) {
        for (int i=0;i<N;i++) c[i]=0,nxt[i]=0,w[i]=0,h[i]=0;
        for (int i=0;i<M;i++) ft[i]=0,head[i]=0,s[i]=0,st[i]=0;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&c[i]);ft[c[i]]=c[i];
            if (c[i]!=c[i-1]) mdf(w,i,1),h[i]=1;
            if(!head[c[i]])st[c[i]]=i;
            s[c[i]]++;nxt[i]=head[c[i]];head[c[i]]=i;
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&x);
            if(x==2) {
                scanf("%d%d",&a,&b);
                ans=qry(w,b)-qry(w,a-1)+1-h[a];
                printf("%d\n",ans);
            }else 
            {
                scanf("%d%d",&a,&b);
                if(a==b)continue;
                if(s[ft[a]]>s[ft[b]])
                    swap(ft[a],ft[b]);
                a=ft[a];b=ft[b];
                if(s[a]==0)continue;
                s[b]+=s[a];s[a]=0;
                solve(a,b);
            }
        }
    }
    //printf("%d",qry(w,5));
}