#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long sum[10], len[10];
const int N = 100100;
string z[N];
int num[N];
char buf[N];
long long tw[N];
inline long long pw(long long a, int b) {
  long long ans = 1;
  b %= mod;
  for (int i = 0; i < int(31); ++i) {
    if (b & (1 << i)) {
      (ans *= a) %= mod;
    }
    (a *= a) %= mod;
  }
  return ans;
}
int main() {
  string s;
  getline(cin, s);
  int q;
  cin >> q;
  for (int i = 0; i < int(10); ++i) {
    sum[i] = i;
    len[i] = 10;
  }
  string t1;
  getline(cin, t1);
  for (int i = 0; i < int(q); ++i) {
    buf[0] = 0;
    scanf("%d->", &num[i]);
    getline(cin, z[i]);
  }
  for (int i = int(q) - 1; i >= 0; --i) {
    long long sum1 = 0, len1 = 1;
    for (int j = 0; j < int(z[i].size()); ++j) {
      (sum1 *= len[int(z[i][j]) - '0']) %= mod;
      (sum1 += sum[int(z[i][j]) - '0']) %= mod;
      (len1 *= len[int(z[i][j]) - '0']) %= mod;
    }
    len[num[i]] = len1;
    sum[num[i]] = sum1;
  }
  long long ans = 0;
  for (int i = 0; i < int(s.size()); ++i) {
    (ans *= len[int(s[i]) - '0']) %= mod;
    (ans += sum[int(s[i]) - '0']) %= mod;
  }
  cout << ans << endl;
  return 0;
}
