/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<20;
#define UnionFindSIZE 1234567
map<int,int>AA[UnionFindSIZE];
int map_id[UnionFindSIZE];
struct Union_Find{
    int d[UnionFindSIZE],num[UnionFindSIZE];
    void init(int n){
        REP(i,n)d[i]=i,num[i]=1,map_id[i]=i;
    }
    int find(int x){
        int y = x, z = x;
        while(y != d[y]) y = d[y];
        while(x != y){
            x = d[x];
            d[z] = y;
            z = x;
        }
        return y;
    }
    bool is_root(int x){return d[x]==x;}
    bool uu(int x,int y){
        x=find(x);
        y=find(y);
        if(x==y)return 0;
        if(num[x]>num[y])swap(x,y);
        if(SZ(AA[map_id[x]])>SZ(AA[map_id[y]])){
            swap(map_id[x],map_id[y]);
        }
        for(auto v:AA[map_id[x]]){
            AA[map_id[y]][v.F]+=v.S;
        }
        num[y]+=num[x];
        d[x]=y;
        return 1;
    }
}U;
int N,Q;
int C[SIZE];
void solve() {
    REP(i,Q){
        int ty;
        R(ty);
        if(ty==1){
            int a,b;
            R(a,b);
            a--;b--;
            U.uu(a,b);
        }else{
            int x,y;
            R(x,y);
            x--;
            W(AA[map_id[U.find(x)]][y]);
        }
    }
}
void input() {
    R(N,Q);
    U.init(N);
    REP(i,N){
        R(C[i]);
        AA[i][C[i]]=1;
    }
}
int main(){
    input();
    solve();
    return 0;
}

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#define N 200008
using namespace std;
int a[N],f[N];
map<int,int>mp[N];
int find(int);
int main()
{
	map<int,int>::iterator k;
	int i,n,q,typ,x,y;
	scanf("%d %d",&n,&q);
	for(i=1;i<=n;++i)
	{
		scanf("%d",&a[i]);
		f[i]=i;mp[i][a[i]]=1;
	}
	while(q--)
	{
		scanf("%d %d %d",&typ,&x,&y);
		if(typ==1)
		{
			x=find(x);y=find(y);
			if(x==y)continue;
			if(mp[x].size()<mp[y].size())swap(x,y);
			for(k=mp[y].begin();k!=mp[y].end();++k)
				mp[x][k->first]+=k->second;
			f[y]=x;
		}
		else
		{x=find(x);printf("%d\n",mp[x][y]);}
	}
	return 0;
}
int find(int u)
{
	int i=u,j;
	while(i!=f[i])i=f[i];
	while(u!=f[u])
	{
		j=u;
		u=f[u];
		f[j]=i;
	}
	return i;
}
