Find a set of patterns 1

Input

The first line contains a natural number $n$ (n \leq 100), the number of strings in set T. Each of the next $n$ lines contains a nonempty string of no more than $80$ characters.

The remaining part of the input contains the strings from set S. Each line consists of ASCII characters with codes from $32$ to $126$ inclusive. A string may be empty; it is guaranteed that the string length does not exceed $250$ characters.

It is guaranteed that the total size of the input file does not exceed $1$ MB.

Output

Print all the strings from set S (in the same order as in the input) that contain at least one string from set T as a substring.

Examples