#[allow(unused_imports)]
use std::cmp::{min,max};
#[allow(unused_imports)]
use std::collections::{BTreeMap,BTreeSet};
#[allow(unused_imports)]
use std::ops::*;
#[allow(unused_imports)]
use std::collections::BinaryHeap;

#[allow(unused_macros)]
macro_rules! ite {
    ($c:expr, $t:expr, $f:expr) => {{
        if $c { $t } else { $f }
    }};
}

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($parser:ident) => {};
    ($parser:ident, ) => {};
    ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($parser, $t);
        input_inner!{$parser $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

pub fn solve_aoj_dsl_1_a(n: usize, qs: &[(usize,usize,usize)]) -> Vec<i64> {
    let mut uf = UnionFind::new(n);
    let mut res = vec![];
    for &(t,i,k) in qs {
        match t {
            0 => {
                uf.unite(i, k);
            }
            1 => {
                let r = uf.is_same_set(i, k);
                res.push(if r { 1 } else { 0 });
            }
            _ => panic!()
        }
    }
    res
}

fn main() {
    input! {
        n: usize,
        m: usize,
        qs: [(usize,usize,usize); m],
    }
    let res = solve_aoj_dsl_1_a(n, &qs);
    for &x in &res {
        println!("{}", x);
    }
}

use std::io::BufRead;
use std::io;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}

impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl<R:BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len,complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                (len, buf2[len-1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T:str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            }
            else {
                self.update_buf();
            }
        }
    }
}

struct UnionFindNode {
    parent: usize,
    num: usize,
}

impl UnionFindNode {
    fn new(parent: usize) -> UnionFindNode {
        UnionFindNode {
            parent: parent,
            num: 1,
        }
    }
}

pub struct UnionFind(Vec<UnionFindNode>);

impl UnionFind {
    pub fn new(n: usize) -> UnionFind {
        let mut xs = vec![];
        for i in 0..n {
            xs.push(UnionFindNode::new(i));
        }
        UnionFind(xs)
    }
    pub fn root(&mut self, i: usize) -> usize {
        let parent = self.0[i].parent;
        if parent == i {
            i
        }
        else {
            let res = self.root(parent);
            self.0[i].parent = res;
            res
        }
    }
    pub fn unite(&mut self, i: usize, k: usize) {
        let i = self.root(i);
        let k = self.root(k);
        if i == k {
            return;
        }
        let (i,k) = if self.0[i].num < self.0[k].num {
            (i,k)
        }
        else {
            (k,i)
        };
        self.0[i].parent = k;
        self.0[k].num += self.0[i].num;
    }
    pub fn is_same_set(&mut self, i: usize, k: usize) -> bool {
        self.root(i) == self.root(k)
    }
}

use std::fmt::Display;
#[allow(dead_code)]
fn write_vec<T: Display>(xs: &Vec<T>) {
    if xs.len() == 0 {
        println!();
        return;
    }
    print!("{}", xs[0]);
    for i in 1..xs.len() {
        print!(" {}", xs[i]);
    }
    println!();
}



Measured memory_bytes: 9012