#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> rem;
map<long long int, long long int> power;
long long int pow2(long long int base, long long int p) {
  if (p == 0) return 1;
  long long int ans = pow2(base, p / 2);
  ans *= ans;
  ans %= (long long int)1e9 + 7;
  if (p & 1) {
    ans *= base;
  }
  ans %= (long long int)1e9 + 7;
  assert(ans >= 0);
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  for (long long int i = 0; i < (long long int)(10); i++) rem[i] = i;
  for (long long int i = 0; i < (long long int)(10); i++) power[i] = 1;
  string s;
  cin >> s;
  long long int q;
  cin >> q;
  vector<pair<long long int, string>> queries(q);
  for (long long int i = 0; i < (long long int)(q); i++) {
    string temp;
    cin >> temp;
    queries[i].first = temp[0] - '0';
    queries[i].second = temp.substr(3, temp.length() - 3);
  }
  reverse(queries.begin(), queries.end());
  for (long long int i = 0; i < (long long int)(q); i++) {
    string t = queries[i].second;
    long long int d = queries[i].first;
    long long int p = 0;
    for (char x : t) {
      p += power[x - '0'];
      p %= ((long long int)1e9 + 7 - 1);
    }
    long long int mod = 0;
    for (long long int i = 0; i < t.size(); i++) {
      mod = mod * pow2(10, power[t[i] - '0']) + rem[t[i] - '0'];
      mod %= (long long int)1e9 + 7;
    }
    rem[d] = mod;
    power[d] = p;
  }
  for (long long int i = 0; i < (long long int)(10); i++) {
  }
  long long int mod = 0;
  for (long long int i = 0; i < s.size(); i++) {
    mod = mod * pow2(10, power[s[i] - '0']) + rem[s[i] - '0'];
    mod %= (long long int)1e9 + 7;
  }
  cout << mod << endl;
}
