Find a set of patterns 2

Input

The first line contains the number of strings $n$ (1 \leq n \leq 1000) in the set $\text{T}$. Each of the next $n$ lines contains a nonempty string. It is guaranteed that the total length of all strings from the set $\text{T}$ does not exceed $80000$.

The remainder of the input contains the strings from the set $\text{S}$. Each line consists of ASCII characters with codes from $32$ to $126$ inclusive. A string may be empty.

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

Output

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

Examples