#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    string valerio; cin >> valerio;
    ll n; cin >> n;
    string x;
    vector<ll> f(0);
    bool found = false;
    for (ll i = 0; i < n; i++)
    {
        cin >> x;
        if (x.find(valerio) != string::npos && x.length() > valerio.length())
        {
            x.erase(x.find(valerio), valerio.length());
            f.push_back(stoi(x));
        }
        else if (x == valerio)
        {
            found = true;
            f.push_back(0);
        }
    }
    sort(f.begin(), f.end());
    ll i = 0;
    for (i = 0; i < f.size(); i++)
    {
        if (i != f[i] && found)
        {
            cout << valerio << i << endl;
            return 0;
        }
        else if (!found)
        {
            cout << valerio << endl;
            return 0;
        }
    }
    cout << valerio << i << endl;

    return 0;
}