#include <bits/stdc++.h>
using namespace std;
long long n, key;
string s, now;
string mp[100005][10];
long long dp[2][100005][10];
void dfs(long long val, long long deep);
int main() {
  long long i, j, k, len, ans;
  cin >> s;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> key;
    getchar();
    getchar();
    getline(cin, now);
    for (j = 0; j < 10; j++) {
      if (key != j) {
        mp[i][j].clear();
        mp[i][j].push_back(j + '0');
      } else {
        mp[i][j] = now;
      }
    }
  }
  ans = 0;
  len = s.size();
  memset(dp, -1, sizeof(dp));
  for (i = 0; i < len; i++) {
    k = s[i] - '0';
    dfs(k, 0);
    ans *= dp[1][0][k];
    ans %= 1000000007;
    ans += dp[0][0][k];
    ans %= 1000000007;
  }
  cout << ans << endl;
  return 0;
}
void dfs(long long val, long long deep) {
  if (dp[0][deep][val] != -1) {
    return;
  }
  if (deep >= n) {
    dp[0][deep][val] = val;
    dp[1][deep][val] = 10;
    return;
  }
  long long i, len, now;
  dp[0][deep][val] = 0;
  dp[1][deep][val] = 1;
  len = mp[deep][val].size();
  for (i = 0; i < len; i++) {
    now = mp[deep][val][i] - '0';
    dfs(now, deep + 1);
    dp[0][deep][val] *= dp[1][deep + 1][now];
    dp[0][deep][val] %= 1000000007;
    dp[0][deep][val] += dp[0][deep + 1][now];
    dp[0][deep][val] %= 1000000007;
    dp[1][deep][val] *= dp[1][deep + 1][now];
    dp[1][deep][val] %= 1000000007;
  }
}
