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 $ .
自动补全是一个程序功能，允许在输入文本(在编辑器，命令行l，浏览器等)的时候通过其输入部分完成剩下的文本。Vasya正忙着开发一款名为“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 \leq n \leq 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 \leq n \leq 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.