CF53A.Autocomplete

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.

自动补全（Autocomplete）是一种程序功能，用于在编辑器、命令行终端、浏览器等环境中输入文本时，根据已输入的部分自动完成整个文本。瓦夏正在开发一款名为“BERowser”的新浏览器，此时他正专注于实现地址栏中的自动补全功能。已知一个包含用户最近访问过的 $n$ 个网页地址的列表，以及当前已输入的字符串 $s$。你的任务是将 $s$ 补全为该列表中某个网页的完整地址，且要求所补全得到的地址是所有以 $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.

第一行包含字符串 $s$，表示输入的部分。第二行包含一个整数 $n$（$1 ≤ n ≤ 100$），表示访问的网页数量。接下来是 $n$ 行，每行一个访问过的网页。所有行的长度均为 $1$ 至 $100$ 个字符（含端点），且仅由小写拉丁字母组成。

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.

如果字符串 $s$ 不是任意一个已访问页面的 $n$ 个地址的开头，则输出 $s$；否则，输出所有以 $s$ 开头的已访问页面地址中字典序最小的一个。

字典序即单词在字典中的排列顺序。字符串的字典序比较在现代编程语言中通过 < 运算符实现。