// Skyqwq
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
 
typedef long long LL;
 
const int N = 2005, P = 1e9 + 7;
 
char s[N], g[N];
 
int n, m, tr[N][10], fail[N], idx, w[N], q[N], ans, f[N][N];
 
void insert() {
    int p = 0;
    for (int i = 1; g[i]; i++) {
        int ch = g[i] - '0';
        if (!tr[p][ch]) tr[p][ch] = ++idx;
        p = tr[p][ch];
    }
    w[p] = 1;
}
 
void build() {
    int hh = 1, tt = 0;
    for (int i = 0; i < 10; i++)
        if (tr[0][i]) q[++tt] = tr[0][i];
    while (hh <= tt) {
        int u = q[hh++];
        for (int i = 0; i < 10; i++) {
            int v = tr[u][i];
            if (v) fail[v] = tr[fail[u]][i], q[++tt] = v, w[v] |= w[fail[v]];
            else tr[u][i] = tr[fail[u]][i];
        }
    }
}
 
void work(int p, int c, int len) {
    for (int i = 0; i < c; i++) {
        if (len == n - 1 && i == 0) {
            for (int j = 1; j < n; j++) {
                for (int k = 1; k < 10; k++) {
                    int t = tr[0][k];
                    (ans += f[j - 1][t]) %= P;
                }
            }
            continue;
        }
        int t = tr[p][i];
        if (w[t]) continue;
         (ans += f[len][t]) %= P;
    }
}
 
void inline dp() {
    int p = 0;
    for (int i = 1; i <= n; i++) {
        int c = s[i] - '0';
        work(p, c, n - i);
        p = tr[p][c];
        if (w[p]) return;
    }
    (ans += 1) %= P;
}
 
int main() {
    scanf("%s%d", s + 1, &m);
    n = strlen(s + 1);
    while (m--) {
        scanf("%s", g + 1);
        insert();
    }
    build();
    for (int i = 0; i <= idx; i++) if (!w[i]) f[0][i] = 1;
    for (int i = 1; i <= n; i++) {
        for (int u = 0; u <= idx; u++) {
            if (w[u]) continue;
            for (int j = 0; j < 10; j++) {
                int v = tr[u][j];
                if (w[v]) continue;
                (f[i][u] += f[i - 1][v]) %= P;
            }
        }
    }
    dp();
    printf("%d\n", ans);
    return 0; 
}