#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
#define ALL(x) (x).begin(), (x).end()
#define coutY cout << "Yes" << endl;
#define coutN cout << "No" << endl;
#define arrIn(arr, start, N) for (ll i = (start); i < (N); ++i) cin >> arr[i];
#define arrOut(arr, start, N) for  (ll i = (start); i < (N); ++i) { cout << arr[i] <<" "; } cout << endl;
#define mod9 998244353
#define mod1 1000000007
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
void YN(bool tf) { cout << (tf ? "YES\n" : "NO\n"); }
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc="abcdefghijklmnopqrstuvwxyz";

//cout << fixed << setprecision(20) <<

bool kaibun(string S){
  string T=S;
  reverse(ALL(S));
  return S==T;
}

auto start = high_resolution_clock::now();

bool CheckTime(auto limit,auto eps){
  auto end = high_resolution_clock::now();
  return  duration_cast<milliseconds>(end - start).count()<limit-eps;
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  string A;
  cin >> A;
  ll Alen=A.size();
  map<char,ll> index;
  for(ll i=0;i<Alen;i++){
    index[A[i]]=i;
  }
  vll d(Alen,vl (Alen));
  for(ll i=0;i<Alen;i++){
    for(ll j=0;j<Alen;j++){
      cin >> d[i][j];
    }
  }
  
  ll N,M;
  cin >> N >> M;
  vs S(N);
  for(ll i=0;i<N;i++){
    cin >> S[i];
  }
  
  for(ll i=0;i<N;i++){
    ll ans=0;
    for(ll j=0;j<N;j++){
      for(ll k=0;k<Alen;k++){
        ans+=d[index[S[i][k]]][index[S[j][k]]];
      }
    }
    cout << ans << endl;
  }
  
  
  
  return 0;
}