s = input()
n = int(input())
words = []
for _ in range(n):
line = input()
if line.startswith(s):
words.append(line)
if len(words) > 0:
print(min(words))
else:
print(s)
#include<bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
ios::sync_with_stdio(0);cin.tie(0);
string s;
ll n;
cin>>s>>n;
string tx[n];
for(ll i=0;i<n;++i){cin>>tx[i];}
string ans="";
for(ll i=0;i<n;++i){
for(ll j=0;j<s.size();++j){
if(s[j]!=tx[i][j]){break;}
if(j==s.size()-1){
if(ans==""){
ans=tx[i];
break;
}
ans=min(ans,tx[i]);
}
}
}
if(ans==""){ans=s;}
cout<<ans;
return 0;
}32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |