Autocomplete

**题目描述** 给定一个字符串 $s$。此外还有 $n$ 个字符串，你必须找到这 $n$ 个字符串里，字典序最小的前缀为 $s$ 的字符串。 如果没有符合条件的字符串（即这 $n$ 个字符串均不以 $s$ 作为前缀），那就输出 $s$ 本身。 **输入** 第一行 $s$，第二行 $n$，之后 $n$ 行为 $n$ 个匹配字符串。 **输出** 一个字符串，如题面所求。 **数据范围**： - $1\leq n\leq100$ - $1\leq\text{所有字符的长度}\leq100$ - 保证所有字符串都由小写字母组成

Autocomplete is a program function that enables inputting the text (in editors, command line shells, browsers etc.) completing the text by its inputted part. Vasya is busy working on a new browser called 'BERowser'. He happens to be working on the autocomplete function in the address line at this very moment. A list consisting of $ n $ last visited by the user pages and the inputted part $ s $ are known. Your task is to complete $ s $ to make it an address of one of the pages from the list. You have to find the lexicographically smallest address having a prefix $ s $ .

The first line contains the $ s $ line which is the inputted part. The second line contains an integer $ n $ ( $ 1<=n<=100 $ ) which is the number of visited pages. Then follow $ n $ lines which are the visited pages, one on each line. All the lines have lengths of from $ 1 $ to $ 100 $ symbols inclusively and consist of lowercase Latin letters only.

If $ s $ is not the beginning of any of $ n $ addresses of the visited pages, print $ s $ . Otherwise, print the lexicographically minimal address of one of the visited pages starting from $ s $ . The lexicographical order is the order of words in a dictionary. The lexicographical comparison of lines is realized by the '<' operator in the modern programming languages.

next
2
nextpermutation
nextelement

nextelement

find
4
find
findfirstof
findit
fand

find

find
4
fondfind
fondfirstof
fondit
fand

find