Excuses, Excuses!

A judge is frustrated by the flimsy excuses that people summoned for jury duty give in order to avoid serving. To cut down the time spent listening to silly excuses, write a program that searches a list of excuses for a list of keywords so it can flag the lame ones. Keywords are matched regardless of letter case.

The input consists of several data sets. The first line of each set contains exactly two integers. The first, $K$ ($1 \le K \le 20$), is the number of keywords to search for. The second, $E$ ($1 \le E \le 20$), is the number of excuses in the set. The next $K$ lines each contain exactly one keyword. The following $E$ lines each contain exactly one excuse.

Every keyword consists only of contiguous lowercase alphabetic characters of length $L$ ($1 \le L \le 20$) and occupies columns $1$ through $L$ of its line. An excuse may contain any uppercase or lowercase alphanumeric character, a space, or any of the punctuation marks ".,!? and is at most $70$ characters long. Every excuse contains at least one non-space character.

Input continues until the end of file.

For each data set, print the worst excuse or excuses. The worst excuse is the one that contains the greatest number of keyword incidences. A keyword is counted as occurring in an excuse only when it appears in contiguous form and is bounded on each side by the start or end of the line, a space, or any non-alphabetic character. Each separate appearance of a keyword counts as one incidence.

Begin each data set's output with a line consisting of Excuse Set # immediately followed by the set number (starting at $1$). On the following lines, print every worst excuse exactly as it was read in. When several excuses tie for the worst, print them in the order in which they appear in the input. Separate consecutive data sets with a blank line.