P7475 "C.E.L.U-02" Simple Input Method.

YQH has a great dream: he wants to become the strongest man in the world. To achieve this goal, he plans to start his journey with a simple input method.

This simple input method originally has a dictionary $\text{U}$. When the user types, the input method reads a string $s$ and an integer $x$ from the user. For this string, there are several cases: Let the number of words $s_i \in \text{U}$ such that $s$ is a prefix of $s_i$ be $a$. - When $a \ge x$, output the $x$-th $s_i$ after sorting by output count in descending order as the first key and lexicographical order as the second key, and then increase its output count by $1$. - When $x > a > 0$, output the last $s_i$ after sorting by output count in descending order as the first key and lexicographical order as the second key, and then increase its output count by $1$. - When $a = 0$, output `404Error`.

Line $1$ contains an integer $n$, representing that there are originally $n$ words in $\text{U}$. The initial output count of every originally existing word is $0$. Lines $2$ to $n+1$ each contain a string $str$, representing a word that originally exists in the dictionary. Line $n+2$ contains an integer $m$, representing that the user performs $m$ operations. Lines $n+3$ to $n+m+2$ each contain a string $s$ and an integer $x$, whose meanings are described above.

For each of the user’s $1$ operation, output a string.

### Sample Explanation **Sample Explanation 1** There is only $1$ word with prefix `fat`, so output `father`, and increase its output count by $1$. For prefix `fa`, the word with the highest output count is `father`, so output it, and increase its output count by $1$. For prefix `fan`, all output counts are $0$, but `fan` is the smallest in lexicographical order, so output it, and increase its output count by $1$. For prefix `fan`, the word with the highest output count is `fan`, so output `fan`, and increase its output count by $1$. For prefix `fa`, the word with the highest output count is `fan`, so output it, and increase its output count by $1$. There is only one word with prefix `fant`, which is `fantasy`, so output it, and increase its output count by $1$. ### Constraints | Test ID | $n$ | $m$ | $x$ | $\sum str$ | | :----------: | :----------: | :----------: | :----------: | :----------: | | $1\sim 2$ | $\le100$ | $\le100$ | $=1$ | $\le10^3$ | | $3\sim 4$ | $\le100$ | $\le100$ | $\diagdown$ | $10^3$ | | $5\sim 8$ | $\le5\times10^4$ | $\le10^5$ | $=1$ | $\le5\times10^5$ | | $9\sim 14$ | $\le10^4$ | $\le10^5$ | $\diagdown$ | $\le10^5$ | | $15\sim 20$ | $\le5\times10^4$ | $\le10^5$ | $\diagdown$ | $\le5\times10^5$ | For $100\%$ of the testdata, $|s|,|str|\le10,1\leq x\le10^4$, and all letters are lowercase letters. Translated by ChatGPT 5