#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	string s; cin >> s;
	int sn = s.size();
	vector<int>idx(26, -1);
	rep(i, s.size())idx[s[i] - 'a'] = i;
	vector d(s.size(), vector<long long>(s.size()));
	rep(i, sn)rep(j, sn)cin >> d[i][j];
	int n, m; cin >> n >> m;
	vector cnt(m, vector<int>(26));
	vector<string>t(n);
	rep(i, n) {
		cin >> t[i];
		rep(j, m) cnt[j][t[i][j] - 'a']++;
	}
	rep(i, n) {
		long long ans = 0;
		rep(j, m) {
			int jj = idx[t[i][j] - 'a'];
			rep(k, 26) {
				int kk = idx[k];
				if (kk == -1)continue;
				ans += d[jj][kk] * cnt[j][k];
			}
		}
		cout << ans << endl;
	}
	return 0;
}