#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m;
    std::cin >> m >> n;
    
    std::vector a(m, std::vector<int>(m));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> a[i][j];
        }
    }
    
    std::string s;
    std::cin >> s;
    
    std::vector<std::pair<int, int>> nxt(m);
    for (int i = 0; i < m; i++) {
        nxt[i] = {i, n};
    }
    std::vector<i64> f(1 << m);
    for (int i = n - 1; i >= 0; i--) {
        int mask = 0;
        int x = s[i] - 'a';
        for (int j = 0; j < m; j++) {
            if (nxt[j].second == n) {
                break;
            }
            int y = nxt[j].first;
            f[mask] += a[x][y];
            f[mask | 1 << x] -= a[x][y];
            f[mask | 1 << y] -= a[x][y];
            f[mask | 1 << x | 1 << y] += a[x][y];
            if (nxt[j].first == x) {
                break;
            }
            mask |= 1 << y;
        }
        int j = 0;
        while (nxt[j].first != x) {
            j++;
        }
        nxt.erase(nxt.begin() + j);
        nxt.insert(nxt.begin(), std::make_pair(x, i));
    }
    for (int i = 1; i < (1 << m); i *= 2) {
        for (int j = 0; j < (1 << m); j += 2 * i) {
            for (int k = 0; k < i; k++) {
                f[i + j + k] += f[j + k];
            }
        }
    }
    for (int i = 0; i < (1 << m); i++) {
        std::cout << f[i] << " \n"[i == (1 << m) - 1];
    }
    
    return 0;
}