#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 500010

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

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

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,m,lastans,fa[N],len[N],deep[N];

bool flag[N];

int find(int x){return fa[x]==x?x:find(fa[x]);}

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

{

    int p=find(x),q=find(y);

    if (p!=q)

    {

        if (deep[p]<deep[q]) swap(p,q);

        fa[q]=p;if (deep[p]==deep[q]) deep[p]++;

        len[q]=i;

    }

}

int query(int x,int y)

{

    int p=find(x),q=find(y);

    if (p!=q) return ;

    int u=x;while (fa[u]!=u) flag[u]=,u=fa[u];flag[u]=;

    int ans=;

    while (!flag[y]) ans=max(ans,len[y]),y=fa[y];

    u=x;while (u!=y) ans=max(ans,len[u]),flag[u]=,u=fa[u];

    while (fa[u]!=u) flag[u]=,u=fa[u];flag[u]=;

    return ans;

}

int main()

{

#ifndef ONLINE_JUDGE

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

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

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read(),m=read();

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

    int cnt=;

    while (m--)

    {

        int op=read();

        if (op==)

        {

            int x=read()^lastans,y=read()^lastans;

            merge(x,y,++cnt);

        }

        else

        {

            int x=read()^lastans,y=read()^lastans;

            printf("%d\n",lastans=query(x,y));

        }

    }

    return ;

}