Spelling Bee

The New York Times publishes a daily puzzle called "Spelling Bee." The puzzle shows 7 letters in a hexagon: 6 letters around a center letter. The goal is to find as many words as possible that meet all of these conditions:

• They contain only letters shown in the hexagon.
• They are at least 4 letters long.
• They contain the center letter.

A letter may be used more than once, and not all letters need to be used.

After playing for a while, you get stuck. Then you remember that the Linux distribution on your computer includes a machine-readable file, /usr/share/dict/words, with 102,305 dictionary words.

You cannot excel at Spelling Bee, but you can excel at programming. So you decide to write a program that finds all solutions to a Spelling Bee puzzle in the dictionary.

The input is a single test case. The first line has 7 distinct lowercase English letters. The first letter is the center letter. The next line contains an integer $n$ ($1 \le n \le 102\,305$), the size of the dictionary. This is followed by $n$ lines, each containing a dictionary word of $l$ lowercase English letters ($1 \le l \le 24$).

Print the words that match the Spelling Bee puzzle, in the order they appear in the dictionary, one per line. The input guarantees that at least one dictionary entry matches.