#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cstdlib>
#include <tuple>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx6[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy6[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

template <class T>
void AddNr(T &a, T b) {
	a = a + b;
	while (a >= MOD1) {
		a -= MOD1;
	}
	while (a < 0) {
		a += MOD1;
	}
}

int N, M, LAST_OPERATION = 1;
vector <int> root;
stack <tuple <int, int, int> > s_root;

int GetRoot(int x) {
	
	if (root[x] != x) {
		s_root.push({LAST_OPERATION, x, root[x]});
		root[x] = GetRoot(root[x]);
	}
	
	return root[x];
}

void Merge(int x, int y) {
	s_root.push({LAST_OPERATION, y, root[y]});
	root[y] = x;
}

int main(){
#ifndef ONLINE_JUDGE

//	freopen("", "r", stdin);
#endif
	
	int i, t, x, y, rx, ry;
	
	ReadNo(N); ReadNo(M);
	

	root.resize(N + 1);
	for (i = 1; i <= N; ++i) {
		root[i] = i;
	}
	
	for (i = 0; i < M; ++i) {
		ReadNo(t);
		if (t == 1) {
			LAST_OPERATION++;
			ReadNo(x); ReadNo(y);
			rx = GetRoot(x);
			ry = GetRoot(y);
			
			Merge(rx, ry);
			
		}
		if (t == 3) {
			ReadNo(x); ReadNo(y);
			rx = GetRoot(x);
			ry = GetRoot(y);
			printf("%d\n", (int) (rx == ry));
		}
		if (t == 2) {
			int cnt, operation, o_root;
			ReadNo(cnt);
			while (cnt--) {
				do {
					tie(operation, x, o_root) = s_root.top();
					if (operation == LAST_OPERATION) {
						s_root.pop();
						root[x] = o_root;
					}
					else {
						break;
					}
				} while (!s_root.empty());
				--LAST_OPERATION;
			}
		}
	}
	
	return 0;
}