The most sample search engine is counting how many times a word appear in a page and gives you a page which is including the most number of word you search.
Now, give you a table of page name and the word it includes and a sentence which user want to search.
Finally, your program should tell user which page is most possible he or she wants
Two number, N and S. 2<= N, S <= 20
N is number of pages.
S is number of keyword in each pages and each one is been parted by space.
Following is N line and each line contain S+1 word. First word is the name of page.
Finally, there is a sentence user want to search and the number of words is between S and (N*S)/2.
Note: All words are less than 15 characters and is lower case. There are no punctuations. There is no newline at end of
Output the name of page which has most key words.
If there are many page have same number of keywords, print out all of them in input order.