#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int K = 11;
const int N = 50010;
int n, k, a[N];
int c[K][N];
int f[K], g[K];
multiset<pii> mp[K][K];
inline void Update(int lesson, int who, int ty) {
    for (int i = 1; i <= k; ++i) if (i != lesson) {
        if (ty == 1) {
            mp[lesson][i].insert(pii(c[who][i] - c[who][lesson], who));
        } else {
            mp[lesson][i].erase(mp[lesson][i].find(pii(c[who][i] - c[who][lesson], who)));
        }
    }
}
signed main() {
    scanf("%lld%lld", &n, &k);
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= k; ++j) 
            scanf("%lld", &c[i][j]);
    for (int i = 1; i <= k; ++i) scanf("%lld", a + i);
    int ans = 0;
    for (int ip = 1; ip <= n; ++ip) {
        for (int i = 1; i <= k; ++i) {
            f[i] = c[ip][i];
            g[i] = 0;
        }
        for (int i = 1; i <= k; ++i) {
            for (int j = 1; j <= k; ++j)
                for (int l = 1; l <= k; ++l) {
                    if (mp[j][l].empty()) continue;
                    auto [x, y] = *mp[j][l].begin();
                    if (f[l] > f[j] + x) {
                        f[l] = f[j] + x;
                        g[l] = j;
                    }
                }
        }
        int cur = 0; f[0] = 1e12;
        for (int i = 1; i <= k; ++i) {
            if (a[i] && f[i] < f[cur]) cur = i;
        }
        // printf("Match %lld->%lld %lld\n", ip, cur, f[cur]);
        // for (int i = 1; i <= k; ++i) printf("%lld ", f[i]);
        // puts("");
        // for (int i = 1; i <= k; puts(""), ++i)
        //     for (int j = 1; j <= k; ++j) {
        //         printf("%lld ", mp[i][j].empty() ? 100000 : mp[i][j].begin()->first);
        //     }
        ans += f[cur];
        --a[cur];
        while (g[cur]) {
            int nxt = g[cur];
            int who = mp[nxt][cur].begin()->second;
            Update(nxt, who, -1);
            Update(cur, who, 1);
            cur = nxt;
        }
        Update(cur, ip, 1);
    }
    printf("%lld\n", ans);
    return 0;
}