package main

// Union Find

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

type node struct {
	parent *node
	num    int
}

func (n *node) String() string {
	return fmt.Sprintf("{ parent: %d, num: %d", n.parent.num, n.num)
}

// ルートのIdxを返す
func find(n int, d []int) int {
	if d[n] < 0 {
		// ルート
		return n
	}
	rootIdx := find(d[n], d)
	d[n] = rootIdx // 更新
	return rootIdx
}
func unite(x, y int, d []int) bool {
	rootX := find(x, d)
	rootY := find(y, d)
	if rootX == rootY {
		// 必要なし
		return false
	}
	if d[rootX] > d[rootY] {
		d[rootX] += d[rootY]
		d[rootY] = rootX
	} else {
		d[rootY] += d[rootX]
		d[rootX] = rootY
	}
	return true
}
func same(x, y int, d []int) bool {
	return find(x, d) == find(y, d)
}
func main() {
	scanner := makeWordScanner()
	n := eGetInt(scanner)
	q := eGetInt(scanner)
	union := make([]int, n)
	for i := 0; i < n; i++ {
		union[i] = -1
	}
	for i := 0; i < q; i++ {
		t := eGetInt(scanner)
		a := eGetInt(scanner)
		b := eGetInt(scanner)
		if t == 0 {
			// unite
			unite(a, b, union)
		} else {
			// query
			if same(a, b, union) {
				fmt.Println("1")
			} else {
				fmt.Println("0")
			}
		}
	}
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
/*
DFS
visited := make(map[int]bool)
var dfs func(int)
collecting := []int{}
dfs = func(n int) {
	visited[n] = true
	collecting = append(collecting, n)
	for _, f := range friends[n] {
		if !visited[f] {
			dfs(f)
		}
	}
}
*/

const (
	TooLarge = math.MaxInt64
	TooSmall = math.MinInt64
)

func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeCharScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanRunes)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetInt64(r *bufio.Scanner) int64 {
	line := eGetLine(r)
	return eAtoInt64(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetInt64s(r *bufio.Scanner) []int64 {
	fields := eGetFields(r)
	ints := make([]int64, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoInt64(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func eAtoInt64(s string) int64 {
	n, err := strconv.ParseInt(s, 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func pow(a, n int) int {
	if n == 0 {
		return 1
	}
	if n == 1 {
		return a
	}
	if n%2 == 1 {
		return pow((a*a), n/2) * a
	}
	return pow((a * a), n/2)
}
func powMod(a, n, mod int) int {
	if n == 0 {
		return 1 % mod
	}
	if n == 1 {
		return a % mod
	}
	if n%2 == 1 {
		return powMod((a*a)%mod, n/2, mod) * a % mod
	}
	return powMod((a*a)%mod, n/2, mod)
}

func factoricalMod(n, count, mod int) int {
	if count == 1 {
		return n % mod
	}
	return (n % mod) * (factoricalMod(n-1, count-1, mod)) % mod
}

func combinationMod(n, a, mod int) int {
	x := factoricalMod(n, a, mod)
	y := factoricalMod(a, a, mod)
	y = powMod(y, mod-2, mod)
	return ((x % mod) * (y % mod)) % mod
}
func countBitOfOn(i, numbits int) int {
	count := 0
	var bit uint64
	for bit = 0; bit < uint64(numbits); bit++ {
		t := 1 << bit
		if i&t > 0 {
			count++
		}
	}
	return count
}



Measured memory_bytes: 2356