#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string s; cin >> s;
    int l = s.length();
    vvll d(l, vll(l));
    rep(i, l)rep(j, l)cin >> d[i][j];
    map<char, int> mp; int itr = 0;
    rep(i, l){
        mp[s[i]] = itr;
        itr++;
    }
    int n, m; cin >> n >> m;
    vector<string> vs(n);
    vvll cnt(m, vll(l, 0));
    rep(i, n){
        cin >> vs[i];
        rep(j, m){
            cnt[j][mp[vs[i][j]]]++;
        }
    }
    rep(i, n){
        ll ans = 0;
        rep(j, m){
            int c = mp[vs[i][j]];
            rep(k, l){
                ans += cnt[j][k]*d[c][k];
            }
        }
        cout << ans << endl;
    }

    return 0;
}