시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 256 MB 0 0 0 0.000%

문제

A code developed by Samuel Morse was first used as a method of electronic communication between two operators sending long and short electrical impulses. These impulses would activate an armature equipped with an electromagnet. The duration of the impules and the silence between them evolved into what is now known as Morse Code.

Letters are represented with a series of dots and/or dashes.  SOS, the universal distress call, is represented by ... --- ... (S = ... and O = ---). Typically, letters are separated by long pauses between them, otherwise they cannot be properly distinguished. Without the proper pauses, the code gets obfuscated.

The word ACM is represented in Morse Code by .- -.-. --, but ANY is represented by .- -. -.-- and without the spacing between code letters, the words ACM and ANY are indistinguishable (.--.-.--).

입력

Input consists of the morse code conversion followed by a dictionary of valid words, then a number of test cases with words in morse code.

The first 26 lines of input each contain a unique upper case letter, a single space, and the morse code equivalent. The letters are in alphabetical order. The morse code equivalents will be exactly the same as the ones below in Sample Input.

The next line contains the number of valid words, N (1 <= N <= 100). The following N lines each contain a word containing 1 to 100 uppercase letters.

The dictionary is followed by one or more test cases. Each begins with a line containing the number of code words W (1 <= W <= 100) or 0 (zero) indicating end of input. The following W lines each contain a code word, in morse code, with no spacing between individual code letters. Each code word will contain 1 to 400 . and/or - symbols. If a codeword matches a word in the dictionary, it will only match a single word in the dictionary.

출력

For each test case, if all of the codewords are found in the dictionary, print a line containing the corresponding alphabetical word of each code word in a sentence on one line with each word separated by a single space. If any codeword in the input does not appear in the dictionary, report only the first such codeword followed by " not in dictionary." and do not print any corresponding alphabetical words.

예제 입력

A .-
B -...
C -.-.
D -..
E .
F ..-.
G --.
H ....
I ..
J .---
K -.-
L .-..
M --
N -.
O ---
P .--.
Q --.-
R .-.
S ...
T -
U ..-
V ...-
W .--
X -..-
Y -.--
Z --..
7
PROGRAMMING
REGIONAL
PARIS
CONTEST
CENTRAL
SOUTH
ACM
6
.--.-.--
...---..--....
-.-..-.-.-..-.-..
.-..--...----..-.-..
.--..-.-----..-..-----..-.--.
-.-.----.-....-
4
.--.-.--
.-...---..-
.-...---..-.
.--.-.--
1
.--..-.-......
0

예제 출력

ACM SOUTH CENTRAL REGIONAL PROGRAMMING CONTEST
.-...---..- not in dictionary.
PARIS

힌트