#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int MAXN = 2e4 + 10;

const int MOD = 1e9 + 7;

int n, m, k, t;

map<string, int> name;

int Fa[MAXN];

int GetF(int x)

{

    if (Fa[x] == x)

        return x;

    Fa[x] = GetF(Fa[x]);

    return Fa[x];

}

int main()

{

    string s;

    cin >> n >> m;

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

    {

        Fa[i] = i;

        cin >> s;

        name[s] = i;

    }

    int op;

    string l, r;

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

    {

        cin >> op >> l >> r;

        if (op == 1)

            Fa[GetF(name[l])] = GetF(name[r]);

        else

        {

            int tl = GetF(name[l]);

            int tr = GetF(name[r]);

            if (tl != tr)

                cout << 0 << endl;

            else

                cout << 1 << endl;

        }

    }

    return 0;

}