#include<cstdio>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

using namespace std;

int n;

struct chairman_tree

{

    int lc,rc,c;

}tr[];int trlen,rt[];

int maketree(int now,int l,int r,int p,int k)

{

    if(now==)now=++trlen;

    tr[now].lc=tr[now].rc=;

    tr[now].c=-;

    if(l==r)tr[now].c=k;

    else

    {

        int mid=(l+r)/;

        if(p<=mid)tr[now].lc=maketree(tr[now].lc,l,mid,p,k);

        else       tr[now].rc=maketree(tr[now].rc,mid+,r,p,k);

    }

    return now;

}

int merge(int x,int y)

{

    if(x==||y==)return x+y;

    tr[x].lc=merge(tr[x].lc,tr[y].lc);

    tr[x].rc=merge(tr[x].rc,tr[y].rc);

    return x;

}

int gofind(int now,int l,int r,int p)

{

    if(l==r)return tr[now].c;

    int mid=(l+r)/;

    if(p<=mid)return gofind(tr[now].lc,l,mid,p);

    else       return gofind(tr[now].rc,mid+,r,p);

}

int findfa(int t,int x)

{

    int F=gofind(rt[t],,n,x);

    if(F==x)return x;

    int tf=findfa(t,F);

    if(tf!=F)

    {

        int root=rt[t];

        rt[t]=maketree(,,n,x,tf);

        rt[t]=merge(rt[t],root);

    }

    return tf;

}

int main()

{

    freopen("disjoint.in","r",stdin);

    freopen("disjoint.out","w",stdout);

    int Q;

    scanf("%d%d",&n,&Q);

    trlen=;memset(rt,,sizeof(rt));

    for(int i=;i<=n;i++)

    {

        rt[i]=maketree(rt[i],,n,i,i);

        rt[i]=merge(rt[i],rt[i-]);

    }

    int op,x,y,tim=,ans=;

    while(Q--)

    {

        scanf("%d",&op);

        if(op==)

        {

            scanf("%d%d",&x,&y);

            int fx=findfa(tim+n,x);

            int fy=findfa(tim+n,y);

            tim++;

            rt[tim+n]=maketree(rt[tim+n],,n,fy,fx);

            rt[tim+n]=merge(rt[tim+n],rt[tim+n-]);

        }

        else if(op==)

        {

            scanf("%d",&x);

            tim++;

            rt[tim+n]=rt[x+n];

        }

        else

        {

            scanf("%d%d",&x,&y);

            int fx=findfa(tim+n,x);

            int fy=findfa(tim+n,y);

            ans=(fx==fy);

            printf("%d\n",ans);

            tim++;

            rt[tim+n]=rt[tim+n-];

        }

    }

    return ;

}