#include <algorithm>
#include <atcoder/all>
#include <bit>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace atcoder;

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define repr3(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --i)

using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vP = vector<P>;
using vPll = vector<Pll>;
using vvP = vector<vector<P>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;

#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

template <class T>
void chmax(T& a, const T& b) {
    if (a < b) a = b;
}
template <class T>
void chmin(T& a, const T& b) {
    if (a > b) a = b;
}

string A;
vvll d;
int N, M;
vs S;
int main() {
    cin >> A;
    int L = A.size();
    d.assign(L, vll(L));
    rep(i, L) rep(j, L) cin >> d[i][j];

    cin >> N >> M;
    S.assign(N, string());
    rep(i, N) cin >> S[i];

    unordered_map<char, int> c2i;
    rep(i, L) c2i[A[i]] = i;

    vvll cnt(M, vll(L));
    rep(i, N) rep(j, M) {
        int l = c2i[S[i][j]];
        cnt[j][l]++;
    }

    vvll sumFromU(M, vll(L));
    rep(j, M) { rep(u, L) rep(v, L) sumFromU[j][u] += d[u][v] * cnt[j][v]; }

    vll ans(N);
    rep(i, N) rep(j, M) {
        int u = c2i[S[i][j]];
        ans[i] += sumFromU[j][u];
    }

    rep(i, N) cout << ans[i] << endl;

    return 0;
}