#include <bits/stdc++.h>
using namespace std;
const long long MXN = 1e3 + 10;
const long long SGM = 10;
const long long INF = 1e15;
long long n, m, k;
long long P[MXN], t0[MXN], Sz[MXN];
long long dp[MXN][MXN], Ind[MXN][MXN], ps[MXN][MXN];
long long nxt[MXN][MXN][SGM], val[MXN][MXN][SGM];
string A, B[MXN], ext;
vector<pair<long long, long long>> vec;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> A >> m, k = n = A.size();
  for (int i = 1; i <= m; i++)
    cin >> B[i], k = max(k, Sz[i] = (long long)B[i].size());
  for (int i = 0; i < 10; i++) cin >> P[i];
  k += 2, vec.resize(m);
  for (int i = 1; i <= m; i++) {
    ext = "";
    for (int j = 0; j < k - B[i].size(); j++) ext += "0";
    B[i] = ext + B[i];
  }
  ext = "";
  iota(Ind[0], Ind[0] + m + 1, 1);
  for (int j = 0; j < k - A.size(); j++) ext += "0";
  A = ext + A;
  reverse(A.begin(), A.end());
  for (int i = 1; i <= m; i++) reverse(B[i].begin(), B[i].end());
  for (int c = 1; c < k; c++) {
    for (int i = 0; i < m; i++) {
      long long r = Ind[c - 1][i];
      vec[i] = make_pair(B[r][c - 1] - '0', -i);
      t0[c] += (Sz[r] <= c);
    }
    sort(vec.begin(), vec.end(), greater<pair<long long, long long>>());
    for (int i = 0; i < m; i++) Ind[c][i] = Ind[c - 1][-vec[i].second];
  }
  for (int c = 0; c < k; c++) {
    for (int d = 0; d < 10; d++) {
      for (int id = 0; id < m; id++) {
        long long r = Ind[c][id];
        val[c][0][d] += P[(B[r][c] - '0' + d) % 10];
        nxt[c][0][d] += ((B[r][c] - '0' + d) >= 10);
      }
      long long sum = 0, oth = val[c][0][d];
      long long ted = 0, oht = nxt[c][0][d];
      for (int j = 1; j <= m; j++) {
        long long r = Ind[c][j - 1];
        sum += P[(B[r][c] - '0' + d + 1) % 10],
            oth -= P[(B[r][c] - '0' + d) % 10];
        ted += ((B[r][c] - '0' + d + 1) >= 10),
            oht -= ((B[r][c] - '0' + d) >= 10);
        val[c][j][d] = sum + oth;
        nxt[c][j][d] = ted + oht;
      }
    }
  }
  for (int i = 0; i < MXN; i++)
    for (int j = 0; j < MXN; j++) {
      dp[i][j] = -INF;
    }
  for (int i = 0; i < k; i++) {
    for (int h = 0; h < m; h++) {
      ps[i][h] = (Sz[Ind[i][h]] <= i) + (!h ? 0 : ps[i][h - 1]);
    }
  }
  dp[0][0] = 0;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= m; j++) {
      long long pre = dp[i][j];
      dp[i][j] = -INF;
      for (int d = 0; d < 10; d++) {
        if (A[i] != '?' && A[i] - '0' != d) continue;
        if (d == 0 && i == n - 1) continue;
        long long mns =
            (i >= n) * (ps[i][m - 1] - (!j ? 0 : ps[i][j - 1])) * P[0];
        dp[i][j] = max(dp[i][j], pre + val[i][j][d] - mns);
        dp[i + 1][nxt[i][j][d]] =
            max(dp[i + 1][nxt[i][j][d]], pre + val[i][j][d] - mns);
      }
    }
  }
  cout << dp[k - 1][0] << '\n';
  return 0;
}
