#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
const int N = 1e5 + 10;
vector<int> r[10];
int to[10][N], rem[N];
long long len[N];
string s[N];
int power(long long b) {
  int ans = 1, t = 10;
  while (b) {
    if (b % 2) ans = 1LL * ans * t % Mod;
    t = 1LL * t * t % Mod;
    b /= 2;
  }
  return ans;
}
int dfs(int v) {
  if (rem[v] != -1) return rem[v];
  rem[v] = len[v] = 0;
  for (int i = 0; i < s[v].size(); i++) {
    int u = to[s[v][i] - '0'][v];
    if (u != 0) {
      int R = dfs(u);
      rem[v] = (1LL * rem[v] * power(len[u]) % Mod + R) % Mod;
      len[v] = (len[v] + len[u]) % (Mod - 1);
    } else {
      rem[v] = (1LL * rem[v] * 10 % Mod + (s[v][i] - '0')) % Mod;
      len[v] = (len[v] + 1) % (Mod - 1);
    }
  }
  return rem[v];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  for (int i = 0; i < 10; i++) r[i].push_back(0);
  cin >> s[0];
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    int d = s[i][0] - '0';
    s[i] = s[i].substr(3, s[i].size() - 3);
    for (int j = 0; j < r[d].size(); j++) to[d][r[d][j]] = i;
    r[d].clear();
    for (int j = 0; j < 10; j++) r[j].push_back(i);
  }
  fill(rem, rem + N, -1);
  cout << dfs(0) << endl;
}
