#include<cstdio>

#include<iostream>

#define R register int

const int N=;

using namespace std;

inline int g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

}

int n,m,tim,lst;

int fa[N],t[N],d[N],rk[N];

int getf(int x) {

    if(x==fa[x]) return x;

    R ret=getf(fa[x]);

    d[x]=d[fa[x]]+; return ret;

}

inline void merge(int u,int v) { ++tim;

    u=getf(u),v=getf(v);

    if(u==v) return;

    if(rk[u]>=rk[v]) fa[v]=u,t[v]=tim;

    else fa[u]=v,t[u]=tim;

    if(rk[u]==rk[v]) ++rk[u];

}

inline int ask(int u,int v) { R ans=;

    if(getf(u)!=getf(v)) return ;

    if(d[u]<d[v]) swap(u,v);

    while(d[u]!=d[v]) ans=max(ans,t[u]),u=fa[u];

    while(u!=v) ans=max(ans,max(t[u],t[v])),u=fa[u],v=fa[v];

    return ans;

}

signed main() {

    n=g(),m=g(); for(R i=;i<=n;++i) fa[i]=i,rk[i]=,d[i]=;

    for(R i=;i<=m;++i) {

        R k=g(),u=g(),v=g(); u^=lst,v^=lst;

        if(k) printf("%d\n",lst=ask(u,v));

        else merge(u,v);

    }

}