Question: The books have indexes at the end, so that, people can search for a specific topic or section using a keyword. You are given the index pages with keywords. Then, you are asked to prepare the index of the book. Write a program which reads the page and keyword information. Then, the program should print the index pages for a given word.

Input specification: In the first line, you will be given two integers: the number of pages (n) with keywords, and the max number of index pages to keep (max). The following n lines start with two integers the page number (p) and the number of keywords (k) in that page where keywords are all in lowercase and contain only 26 English letters with no special char. Then, you will be given k keywords in the same line. After that, you will be given a keyword. Where 1 ≤ n ≤ 40,000, 1 ≤ max ≤ 100 and there may at most 50 keywords in one page.

Output specification: Show the pages that the given keyword appears in ascending order. Show 0, if it doesn't appear on any page. Note: Keep at most max unique-index pages for every keyword. The max index pages will be decided according to the order of appearance. The index page appearing on the after max pages or later will be ignored.

Explanation: There are four pages with keywords and maximum (the first) 2 index pages will be shown. Page 1 contains 2 keywords: book and index, and, there are 5 keywords in total. The following is the list of keywords and their appearing pages:

• appear 7
• book 1
• index 1 5 7
• keyword 4 5
• search 5 7