#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx") 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int buffer=1<<13;
char buff[buffer]; int cnt=0;
int getInt() {
    int number = 0;
    while(buff[cnt] < '0' || '9' < buff[cnt])
        if(++cnt >= buffer) fread(buff, buffer, 1, stdin), cnt = 0;

    while('0' <= buff[cnt] && buff[cnt] <= '9') {
        number = number * 10 + buff[cnt] - '0';
        if(++cnt >= buffer) fread(buff, buffer, 1, stdin), cnt = 0;
    }

    return number;
}
int ata[MAXN],sz[MAXN];
int tap(int x){
	if(ata[x]==x)
		return x;
	return ata[x]=tap(ata[x]);	
}
void merge(int x,int y){
	if((x=tap(x))==(y=tap(y)))	
		return;
	if(sz[x]<sz[y])
		swap(x,y);
	sz[x]+=sz[y];
	ata[y]=x;	
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,q;
    scanf("%d%d",&n,&q);
    int f=1;
    vector<PII>v;
    while(q--){
		int t=getInt();
		f|=(t<3);
		if(t==1){
			int x=getInt(),y=getInt();
			v.pb(mp(x,y));
		}
		else if(t==2){
			int x=getInt();
			while(x-- and !v.empty())
				v.pop_back();
		}
		else{
			if(f){
				for(int i=1;i<=n;i++)
					ata[i]=i,sz[i]=1;
				tr(it,v)
					merge(it->ff,it->ss);
				f=0;	
			}
			int x=getInt(),y=getInt();
			if(tap(x)==tap(y))
				puts("0");
			else
				puts("0");
		}
	}
	return 0;
}