Work-Study Student

Haru became a work-study student whose job was to build a program that finds English words in a sentence and reports their meanings.

Haru never got around to writing the program. One day before the deadline, Haru asked you to help quickly. Please help Haru.

• Each entry is a pair $(Q_i, A_i)$, where $Q_i$ is an English word and $A_i$ is its meaning.
• Given $N$ entries and $M$ sentences, the program answers each sentence as follows.
  • Let the leftmost character of sentence $S$ be at position $1$, and the rightmost at position $|S|$. Here $|S|$ is the length of $S$.
  • The program reads each sentence from the first character to the last, in the order $S_1, S_2, \cdots, S_{|S|}$.
  • While reading, if the characters at positions $k, k+1, \cdots, k+|Q_i|-1$, joined in order, can form $Q_i$ starting at position $k$, the program must answer with $A_i$. If several $Q_i$ can be formed at position $k$, the program answers with the $A_i$ of the $Q_i$ that comes first in dictionary order.
  • One sentence may require several $A_i$ answers.

For example, with the entries (ABC, X), (A, Y), and (CDE, Z) and the sentence ABCDE, the program must answer YXZ.

The first line contains two integers $N$ and $M$, the number of entries and the number of sentences, separated by a space. ($1 \leq N \leq 1\ 000$; $1 \leq M \leq 10$)

From the second line, the next $N$ lines each contain $Q_i$ and $A_i$, separated by a space. ($1 \leq |Q_i|, |A_i| \leq 10$; if $i \neq j$, then $Q_i \neq Q_j$)

The following $M$ lines each contain a string $S_i$. ($1 \leq |S| \leq 100$)

All input strings consist only of uppercase English letters and contain no spaces.

For each string $S_i$, print the string that the program must answer, one per line.

If the program has no answer for a string, print -1 instead.