D. Mahmoud and a Dictionary

D. Mahmoud and a Dictionary

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mahmoud wants to write a new dictionary that contains n words and relations between them. There are two types of relations: synonymy (i. e. the two words mean the same) and antonymy (i. e. the two words mean the opposite). From time to time he discovers a new relation between two words.

He know that if two words have a relation between them, then each of them has relations with the words that has relations with the other. For example, if like means love and love is the opposite of hate, then like is also the opposite of hate. One more example: if love is the opposite of hate and hate is the opposite of like, then love means like, and so on.

Sometimes Mahmoud discovers a wrong relation. A wrong relation is a relation that makes two words equal and opposite at the same time. For example if he knows that love means like and like is the opposite of hate, and then he figures out that hate means like, the last relation is absolutely wrong because it makes hate and like opposite and have the same meaning at the same time.

After Mahmoud figured out many relations, he was worried that some of them were wrong so that they will make other relations also wrong, so he decided to tell every relation he figured out to his coder friend Ehab and for every relation he wanted to know is it correct or wrong, basing on the previously discovered relations. If it is wrong he ignores it, and doesn't check with following relations.

After adding all relations, Mahmoud asked Ehab about relations between some words based on the information he had given to him. Ehab is busy making a Codeforces round so he asked you for help.

Input

The first line of input contains three integers n, m and q (2 ≤ n ≤ 105, 1 ≤ m, q ≤ 105) where n is the number of words in the dictionary, mis the number of relations Mahmoud figured out and q is the number of questions Mahmoud asked after telling all relations.

The second line contains n distinct words a1, a2, ..., an consisting of small English letters with length not exceeding 20, which are the words in the dictionary.

Then m lines follow, each of them contains an integer t (1 ≤ t ≤ 2) followed by two different words xi and yi which has appeared in the dictionary words. If t = 1, that means xi has a synonymy relation with yi, otherwise xi has an antonymy relation with yi.

Then q lines follow, each of them contains two different words which has appeared in the dictionary. That are the pairs of words Mahmoud wants to know the relation between basing on the relations he had discovered.

All words in input contain only lowercase English letters and their lengths don't exceed 20 characters. In all relations and in all questions the two words are different.

Output

First, print m lines, one per each relation. If some relation is wrong (makes two words opposite and have the same meaning at the same time) you should print "NO" (without quotes) and ignore it, otherwise print "YES" (without quotes).

After that print q lines, one per each question. If the two words have the same meaning, output 1. If they are opposites, output 2. If there is no relation between them, output 3.

See the samples for better understanding.

Examples

input

3 3 4
hate love like
1 love like
2 love hate
1 hate like
love like
love hate
like hate
hate like

output

YES
YES
NO
1
2
2
2

input

8 6 5
hi welcome hello ihateyou goaway dog cat rat
1 hi welcome
1 ihateyou goaway
2 hello ihateyou
2 hi goaway
2 hi hello
1 hi hello
dog cat
dog hi
hi hello
ihateyou goaway
welcome ihateyou

output

YES
YES
YES
YES
NO
YES
3
3
1
1
2

嗯，带权并查集的应用。没有学习过带权并查集的可以先看下这里：

http://blog.csdn.net/harlow_cheng/article/details/52737486

然后就没什么多说的了。就两种关系，应该说是比较基本的。

#include <bits/stdc++.h>
using namespace std;
int n,m,q;
const int MAXN=1e5+7;
const int mod=1e9+7;
int pre[MAXN],relation[MAXN];
map<string,int>num;
string s1,s2;

int findx(int x)
{
    if(pre[x]==x)
    {
        return x;
    }
    int order=pre[x];
    pre[x]=findx(pre[x]);
    relation[x]=(relation[x]+relation[order])%2;
    return pre[x];
}
int main()
{
    int i;
    scanf("%d%d%d",&n,&m,&q);
    for(i=0;i<n;++i)
    {
        cin>>s1;
        num[s1]=i;
    }
    for(i=0;i<n;++i)
    {
        pre[i]=i;
        relation[i]=0;
    }
    int x,y,z;
    while(m--)
    {
        cin>>z>>s1>>s2;
        z--;
        x=num[s1],y=num[s2];
        int a=findx(x),b=findx(y);
        if(a!=b)//关系还没有建立过
        {
            puts("YES");
            //更新结点值
            pre[b]=a;
            relation[b]=(relation[x]-relation[y]+z+2)%2;
        }
        else//关系已经建立
        {
            int p=(relation[x]-relation[y]+2)%2;//得到关系
            if(p==z)puts("YES");
            else puts("NO");
        }
    }
    while(q--)
    {
        cin>>s1>>s2;
        x=num[s1];
        y=num[s2];
        int a=findx(x),b=findx(y);
        if(a!=b)puts("3");//没建立过联系
        else
        {
            int p=(relation[x]-relation[y]+2)%2;
            printf("%d\n",p+1);
        }
    }

}