#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

int const xn=5e5+;

int n,m,fa[xn],t[xn],dep[xn],siz[xn],ans,cnt;

int rd()

{

    int ret=,f=; char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

    while(ch>=''&&ch<='')ret=(ret<<)+(ret<<)+ch-'',ch=getchar();

    return f?ret:-ret;

}

int find(int x)

{

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

    int f=find(fa[x]);

    dep[x]=dep[fa[x]]+;

    return f;

}

void merge(int x,int y,int tim)

{

    int u=find(x),v=find(y);

    if(u==v)return;

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

    fa[v]=u; siz[u]+=siz[v]; t[v]=tim;

}

int query(int x,int y)

{

    int u=find(x),v=find(y);

    if(u!=v)return ;

    int ret=;

    if(dep[x]<dep[y])swap(x,y);

    while(dep[x]>dep[y])ret=max(ret,t[x]),x=fa[x];

    while(x!=y)ret=max(ret,max(t[x],t[y])),x=fa[x],y=fa[y];

    return ret;

}

int main()

{

    n=rd(); m=rd();

    for(int i=;i<=n;i++)fa[i]=i,siz[i]=;

    for(int i=,p,u,v;i<=m;i++)

    {

        p=rd(); u=rd(); v=rd();

        u^=ans; v^=ans;

        if(!p)merge(u,v,++cnt);

        else printf("%d\n",ans=query(u,v));

    }

    return ;

}