#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
    string t;
    cin >> t;
    int k=t.size();
    unordered_map<char,int>tr;
    rep(i,k){
        tr[t[i]]=i;
    }
    vector a(k,vector<ll>(k));
    rep(i,k)rep(j,k)cin >> a[i][j];
    int n,m;
    cin >> n >> m;
    vector<string>s(n);
    rep(i,n){
        cin >> s[i];
        rep(j,m){
            s[i][j]=tr[s[i][j]]+'a';
        }
    }

    vector<ll>h(n,0);
    rep(i,m){
        vector<ll>cnt(k,0);
        rep(j,n){
            cnt[s[j][i]-'a']++;
        }
        rep(j,n){
            rep(l,k){
                h[j]+=cnt[l]*a[s[j][i]-'a'][l];
            }
        }
    }
    rep(i,n)cout << h[i] << endl;


    return 0;
}