#include<bits/stdc++.h>

using namespace std;

#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

#define LL long long

#define ULL unsigned LL

#define fi first

#define se second

#define pb push_back

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

#define lch(x) tr[x].son[0]

#define rch(x) tr[x].son[1]

#define max3(a,b,c) max(a,max(b,c))

#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;

const int inf = 0x3f3f3f3f;

const int _inf = 0xc0c0c0c0;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const LL _INF = 0xc0c0c0c0c0c0c0c0;

const LL mod =  (int)1e9+;

const int N = 1e5 + ;

char s[N];

string str[N];

LL dp[], base[];

void solve(string & sstr){

    int m = sstr[] - '';

    int len = sstr.size();

    LL tmp_base = ; LL tmp_yu = ;

    for(int i = ; i < len; ++i){

        int id = sstr[i] - '';

        tmp_base = (tmp_base * base[id]) % mod;

        tmp_yu = (tmp_yu * base[id] + dp[id]) % mod;

    }

    dp[m] = tmp_yu, base[m] = tmp_base;

//    cout << m << ' ' << dp[m] << ' '  << base[m] << endl;

}

int main(){

    scanf("%s", s+);

    int n;

    scanf("%d", &n);

    for(int i = ; i < ; ++i)

        dp[i] = i, base[i] = ;

    for(int i = ; i <= n; ++i){

        cin >> str[i];

    }

    for(int i = n; i >= ; --i){

        solve(str[i]);

    }

    int m = strlen(s+);

    LL ans = ;

    for(int i = ; i <= m; ++i){

        int id = s[i] - '';

        ans = (ans * base[id] + dp[id]) % mod;

    }

    cout << ans << endl;

    return ;

}