def solve():
    # 入力
    A = input().strip()
    A_inv = { a: i for i, a in enumerate(A) }

    L = len(A)
    d = [None for _ in range(L)]
    for i in range(L):
        d[i] = list(map(int, input().split()))

    N, M = map(int, input().split())
    S = [None] * N
    for i in range(N):
        S[i] = [A_inv[x] for x in input().strip()]

    # 前計算
    F = [[0] * L for _ in range(M)]
    G = [None for _ in range(M)]
    for k in range(M):
        Fk = F[k]
        for i in range(N):
            Fk[S[i][k]] += 1

        G[k] = [sum(d[alpha][gamma] * Fk[gamma] for gamma in range(L)) for alpha in range(L)]

    # 本計算
    H = [sum(G[k][S[i][k]] for k in range(M)) for i in range(N)]

    return H

#==================================================
import sys
input = sys.stdin.readline
write = sys.stdout.write

print(*solve(), sep = "\n")