The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple C题What Kind of Fri

What Kind of Friends Are You?

---

Time Limit: 1 Second      Memory Limit: 65536 KB

---

Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sandstar, all the animals have become anthropomorphized into girls known as Friends.

Kaban is a young girl who finds herself in Japari Park with no memory of who she was or where she came from. Shy yet resourceful, she travels through Japari Park along with Serval to find out her identity while encountering more Friends along the way, and eventually discovers that she is a human.

However, Kaban soon finds that it's also important to identify other Friends. Her friend, Serval, enlightens Kaban that she can use some questions whose expected answers are either "yes" or "no" to identitfy a kind of Friends.

To be more specific, there are n Friends need to be identified. Kaban will ask each of them q same questions and collect their answers. For each question, she also gets a full list of animals' names that will give a "yes" answer to that question (and those animals who are not in the list will give a "no" answer to that question), so it's possible to determine the name of a Friends by combining the answers and the lists together.

But the work is too heavy for Kaban. Can you help her to finish it?

Input

There are multiple test cases. The first line of the input is an integer T (1 ≤ T ≤ 100), indicating the number of test cases. Then T test cases follow.

The first line of each test case contains two integers n (1 ≤ n ≤ 100) and q (1 ≤ q ≤ 21), indicating the number of Friends need to be identified and the number of questions.

The next line contains an integer c (1 ≤ c ≤ 200) followed by c strings p₁, p₂, ... , p_c (1 ≤ |p_i| ≤ 20), indicating all known names of Friends.

For the next q lines, the i-th line contains an integer m_i (0 ≤ m_i ≤ c) followed by m_i strings s_{i, 1}, s_{i, 2}, ... , s_i, mi (1 ≤ |s_i, j| ≤ 20), indicating the number of Friends and their names, who will give a "yes" answer to the i-th question. It's guaranteed that all the names appear in the known names of Friends.

For the following n lines, the i-th line contains q integers a_{i, 1}, a_{i, 2}, ... , a_i, q (0 ≤ a_i, j ≤ 1), indicating the answer (0 means "no", and 1 means "yes") to the j-th question given by the i-thFriends need to be identified.

It's guaranteed that all the names in the input consist of only uppercase and lowercase English letters.

Output

For each test case output n lines. If Kaban can determine the name of the i-th Friends need to be identified, print the name on the i-th line. Otherwise, print "Let's go to the library!!" (without quotes) on the i-th line instead.

Sample Input

23 45 Serval Raccoon Fennec Alpaca Moose4 Serval Raccoon Alpaca Moose1 Serval1 Fennec1 Serval1 1 0 10 0 0 01 0 0 05 511 A B C D E F G H I J K3 A B K4 A B D E5 A B K D E10 A B K D E F G H I J4 B D E K0 0 1 1 11 0 1 0 11 1 1 1 10 0 1 0 11 0 1 1 1

Sample Output

ServalLet's go to the library!!Let's go to the library!!Let's go to the library!!Let's go to the library!!BLet's go to the library!!K

Hint

The explanation for the first sample test case is given as follows:

As Serval is the only known animal who gives a "yes" answer to the 1st, 2nd and 4th question, and gives a "no" answer to the 3rd question, we output "Serval" (without quotes) on the first line.

As no animal is known to give a "no" answer to all the questions, we output "Let's go to the library!!" (without quotes) on the second line.

Both Alpaca and Moose give a "yes" answer to the 1st question, and a "no" answer to the 2nd, 3rd and 4th question. So we can't determine the name of the third Friends need to be identified, and output "Let's go to the library!!" (without quotes) on the third line.

---

题目大意:给你T组数据，每个数据一开始有一个n和一个q，n代表他进行n次询问，每次询问不同数量人是否是自己的朋友，q是问编程者是谁回答了他的这个问题，回答了是1没回答是0，同时给你c个朋友，只有询问这几个朋友才能回答1，不是他朋友的回答0，接下来n行就是问了几个人，人名是谁然后01行是询问你谁的回答满足这一行的回答且唯一，如果有输出名字，否则让他滚去图书馆学习解题思路:这道题我可能解释的比较差劲，最好自行翻译一下，这道题的做法是，我希望尽可能的让名字和他是否回答一一对应，这样我们要做的就是用一个map，键为名字，然后他是否回答了他的每次询问，用二进制保存，然后在进行q次询问的时候，每次遍历map就可以了，同时注意答案是否是唯一的这道题打的时候比较尴尬，当时没AC，下来补题的时候一把过，当时真的是用了结构体然后爆了，死都过不了

#include<iostream>    #include<cstdio>  #include<stdio.h>  #include<cstring>    #include<cstdio>    #include<climits>    #include<cmath>   #include<vector>  #include <bitset>  #include<algorithm>    #include <queue>  #include<map>  #include<stack>using namespace std;map<string, long long int> question;int T, n, q, c, i, x,j;long long int ans;string str;int main(){cin >> T;while (T--){question.clear();cin >> n >> q;cin >> c;for (i = 1; i <= c; i++){cin >> str; question[str] = 0;}for (i = 1; i <= q; i++){cin >> x;while (x--){cin >> str;if (question.find(str) != question.end()){question[str] += 1 << (q- i);}}}for (i = 1; i <= n; i++){ans = 0;int flag = 0;for (j = 1; j <= q; j++){cin >> x;ans += x << (q - j);}map<string, long long int>::iterator it;it = question.begin();while (it != question.end()){if (it->second == ans){str = it->first;flag++;}it++;}if (flag == 1)cout << str << endl;elsecout << "Let's go to the library!!" << endl;}}}