Languages

Fedor decided to learn a new language and started by memorizing the names of the digits. To check what he has learned, he picks a number and finds the digit in it whose name comes last in alphabetical order. Fedor is not fully sure of his knowledge yet, so he needs a checker.

Word $a$ comes before word $b$ in alphabetical order if either $a$ is a prefix of $b$, or the two words share their first few characters (possibly none) and the next character of $a$ comes before the corresponding character of $b$ in the alphabet.

Write a program that helps Fedor check his answers. A number is given. Find the digit in it whose name comes last in alphabetical order, compared with the names of the other digits. The digit names are given in the input file.

The first line contains the names of the digits from $0$ to $9$ in the language Fedor is learning, separated by spaces. Each name is nonempty and consists of at most 50 lowercase Latin letters.

The second line contains $n$ ($1 \le n \le 1000$). The next $n$ lines each contain a number $a_i$ for which Fedor wants the answer ($0 \le a_i \le 10^9$, with no leading zeros).

On the $i$-th line, print one word: the name of the digit that appears in $a_i$ and comes last in alphabetical order.