Problem: Steve Jobs' ghost has come down to BITS Pilani Hyderabad Campus, since he has heard a lot about the coding culture here. Hoping to recruit talented people to work on top-secret Apple software, he keeps a strict coding test.

Apple is currently working on a upgraded version of a automated form filler. They call it the iComplete application. Steve Jobs is looking for BPHC talent to work on it.

Therefore, his coding test requires contestants to work on a basic iComplete application.

iComplete V1.0 is an application that works by receiving part of a word and automatically completing it depending on the dictionary present on the device. Therefore for the coding test, you are given a dictionary of n words. Now Steve Jobs will come over to your machine and type a string s. Your task is to complete s to match one of the words in the dictionary.

In case many words have s as a prefix, you have to find the lexicographically smallest word amongst these. In case no match is found, simply return the string s.

Input

The first line contains the string s which Steve Jobs' ghost types. The second line contains an integer n (1 ≤ n ≤ 100) which is the number of words in the dictionary. Then follow n lines which are the words on the dictionary, one on each line. All the lines have lengths of 1 to 100 characters inclusively, and consist of lowercase English letters only.
Output
If s is not the beginning of any of n words in the dictionary, print s. Otherwise, print the lexicographically lowest word beginning with s.

The lexicographical order is the order of words in a dictionary.

Sample test(s)
Input
next
2
nextpermutation
nextelement

Output
nextelement

Input
find
4
find
findfirstof
findit
fand

Output
find

Input
find
4
fondfind
fondfirstof
fondit
fand

Output
find

SAMPLE INPUT
next
2
nextpermutation
nextelement

SAMPLE OUTPUT
nextelement

Explanation

Since nextelement is smaller when seen in dictionary, it is preferred over nextpermutation.

Solution (in PYTHON):

Solution:
s=raw_input()
s_n=len(s)
n=int(raw_input())
a=[]
i=0
c=0
ans_c=0
while i<n:
	exp=raw_input()
	a.append(exp)
	if a[i]==s:
		c=1
		ans=a[i]
	i+=1

if c==0:
	order=200
	ord_i=200
	i=0
	while i<n:
		if a[i].find(s)==0:
			n_ans=a[i]
			ord_i=ord(n_ans[s_n])
		if ord_i<order:
			order=ord_i
			loop_ans=a[i]
			ans_c=1
		i+=1
else:
	print ans

if ans_c==1:
	print loop_ans
elif c==0 and ans_c==0:
	print s