#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    string A; cin >> A;
    int siz = (int)A.size();
    vector<vector<ll>> d(26, vector<ll>(26, 0));
    for(int i=0; i<siz; i++) for(int j=0; j<siz; j++) cin >> d[A[i]-'a'][A[j]-'a'];

    int n, m; cin >> n >> m;
    vector<string> s(n); for(int i=0; i<n; i++) cin >> s[i];
    vector<vector<ll>> cnt(m, vector<ll>(26, 0LL));
    for(int i=0; i<n; i++) for(int j=0; j<m; j++) cnt[j][s[i][j]-'a']++;
    for(int i=0; i<n; i++){
        ll ans = 0LL;
        for(int j=0; j<m; j++){
            for(int k=0; k<26; k++){
                ans += d[s[i][j]-'a'][k]*cnt[j][k];
            }
        }

        cout << ans << '\n';
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    // cin >> T;
    while(T--) solve();
}