Substring Set Membership

The set $S$ has $N$ elements and every element is a string. Given $Q$ strings, decide for each one whether any of its substrings belongs to $S$. Print YES if at least one substring is in $S$, and NO if none of them is. A substring here means a contiguous stretch of the string.

For example, take $S$ to be {"www", "woo", "jun"}. The string "myungwoo" has the substring "woo", which is in $S$, so its answer is YES. The string "hongjun" has the substring "jun", which is in $S$, so its answer is YES. The string "dooho" has no substring in $S$, so its answer is NO.

The first line has the size $N$ of the set $S$. ($1 \le N \le 1000$)

Each of the next $N$ lines has one element of $S$. No element is longer than $100$ characters.

The next line has $Q$, the number of strings to decide. ($1 \le Q \le 1000$)

Each of the next $Q$ lines has one string to decide. No such string is longer than $10000$ characters.

Every string in the input consists of lowercase letters only.

Print $Q$ lines, one answer per input string, in the order the strings were given. Print YES if at least one substring of that string is in $S$, and NO otherwise.