#include <bits/stdc++.h>
template <typename T>
inline bool smax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool smin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
using namespace std;
const int N = 100100;
const int mod = 1e9 + 7;
string s, q[N];
int n, m;
int p[N], a[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> s;
  cin >> n;
  for (int i = 0; i <= n - 1; ++i) {
    cin >> q[i];
  }
  m = s.length();
  for (int i = 0; i <= 9; ++i) {
    p[i] = 10;
    a[i] = i;
  }
  for (int i = n - 1; i >= 0; --i) {
    string s = q[i];
    int num = s[0] - '0';
    int pn = 1, an = 0;
    for (int i = 3; i <= s.length() - 1; ++i) {
      int cur = s[i] - '0';
      pn = (pn * 1ll * p[cur]) % mod;
      an = (an * 1ll * p[cur] + a[cur]) % mod;
    }
    p[num] = pn;
    a[num] = an;
  }
  int res = 0;
  for (int i = 0; i <= m - 1; ++i) {
    int num = s[i] - '0';
    res = (res * 1ll * p[num] + a[num]) % mod;
  }
  printf("%d\n", res);
}
