#include<bits/stdc++.h>
using namespace std;
int n, m, ans;
int fa[500010], d[500010];
int find(int x)
{
    if(x == fa[x]) return x;
    int a = find(fa[x]);
    d[a] = min(d[a], d[x]);
    return fa[x] = a;
}
void connect(int u, int v)
{
    int a = find(u), b = find(v);
    if(a == b) return;
    d[a] = min(d[a], d[b]);
    fa[b] = a;
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) fa[i] = i;
    for(int i = 1; i <= m; ++i)
    {
        int opt, u, v;
        scanf("%d%d%d", &opt, &u, &v);
        u ^= ans;
        v ^= ans;
        if(opt == 0) connect(u, v);
        if(opt == 1)
        {
            int a = find(u), b = find(v);
            if(a != b) 
            {
                ans = 0;
                puts("0");
            }
            else printf("%d\n", ans = d[a]);
        }
    }
    return 0;
}