You are given an undirected graph with N vertices and 0 edges. Process Q queries of the following types.

* `0 u v`: Add an edge (u, v).
* `1 u v`: Print 1 if u and v are in the same connected component, 0 otherwise.

Constraints

* 1 \leq N \leq 200,000
* 1 \leq Q \leq 200,000
* 0 \leq u_i, v_i \lt N

Input

Input is given from Standard Input in the following format:


N Q
t_1 u_1 v_1
t_2 u_2 v_2
:
t_Q u_Q v_Q


出力

For each query of the latter type, print the answer.

Example

Input

4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3


Output

0
1
0
1
import java.util.*;

public class Main {

  private static void solve() {
    int n = ni();
    int q = ni();

    DisjointSet ds = new DisjointSet(n);
    for (int i = 0; i < q; i ++) {
      int t = ni();
      int u = ni();
      int v = ni();

      if (t==0){
        ds.union(u, v);
      }else{
        out.println(ds.equiv(u, v) ? 1 : 0);
      }
    }
  }

  static class DisjointSet {
    public int[] upper; // minus:num_element(root) plus:root(normal)
  //	public int[] w;
    
    public DisjointSet(int n)
    {
      upper = new int[n];
      Arrays.fill(upper, -1);
  //		w = new int[n];
    }
    
    public DisjointSet(DisjointSet ds)
    {
      this.upper = Arrays.copyOf(ds.upper, ds.upper.length);
    }		
    
    public int root(int x)
    {
      return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
    }
    
    public boolean equiv(int x, int y)
    {
      return root(x) == root(y);
    }
    
    public boolean union(int x, int y)
    {
      x = root(x);
      y = root(y);
      if(x != y) {
        if(upper[y] < upper[x]) {
          int d = x; x = y; y = d;
        }
  //			w[x] += w[y];
        upper[x] += upper[y];
        upper[y] = x;
      }
      return x == y;
    }
    
    public int count()
    {
      int ct = 0;
      for(int u : upper){
        if(u < 0)ct++;
      }
      return ct;
    }
    
    public int[][] toBucket()
    {
      int n = upper.length;
      int[][] ret = new int[n][];
      int[] rp = new int[n];
      for(int i = 0;i < n;i++){
        if(upper[i] < 0)ret[i] = new int[-upper[i]];
      }
      for(int i = 0;i < n;i++){
        int r = root(i);
        ret[r][rp[r]++] = i;
      }
      return ret;
    }
  }
  

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
