Magic Cards

Chansu and Junsu are friends at International College of Programming Convergence. One day, Chansu met Junsu and said that "I'll do a magic trick for you. Pick any number between $1$ and $12$, and don't tell me your number. Just keep it in your mind." Junsu chose $11$ in mind. Chansu then showed Junsu the following four cards one by one, asking "Is there your number in this card?" at each time. Junsu answered "Yes, yes, no, yes" in this order. After Chansu made some theatrical gestures with his arms and legs for a while, he finally shouted, "I've got your number. It is $11$." Junsu was surprised because it was exactly the number he had kept in mind. Chansu did not reveal the secret of the trick. He only said, "These cards have a great magic power, so they can read your mind and tell me something only in a magical language, which only I can understand." How does this work? Can you figure out the secret? Now, you are to write a program that answers the number in your friends' minds. The trick can be generalized as follows. You have $K$ magic cards, and each card has exactly $M$ integers between $1$ and $N$, possibly with some repeats. You perform the trick on $F$ friends. From the yes/no sequences of the $F$ friends, you pick out the correct numbers.

The first line contains four integers $N$, $K$, $M$, and $F$ ($1 \le N \le 500\,000$, $1 \le K \le 100$, $1 \le M \le 5\,000$, $1 \le F \le 50\,000$). Each of the following $K$ lines contains $M$ integers between $1$ and $N$, which are the numbers written on one magic card. Each of the following $F$ lines contains a string of length $K$ over Y and N. A Y means "yes" and an N means "no". All answers are correctly given according to the numbers chosen in mind.

Print exactly $F$ lines. The $i$-th line contains the number in the $i$-th friend's mind. If the number of the $i$-th friend cannot be identified uniquely, print 0 on that line.