#include "bits/stdc++.h"

typedef long long ll;
using namespace std;

const int N = 5e4 + 10, M = 5e5 + 10;
#define int long long

struct SSP {
    int cnt = 1, hd[N], nxt[M << 1], to[M << 1], limit[M << 1], cst[M << 1];

    void add(int u, int v, int w, int c) {
        nxt[++cnt] = hd[u], hd[u] = cnt, to[cnt] = v, limit[cnt] = w, cst[cnt] = c;
        nxt[++cnt] = hd[v], hd[v] = cnt, to[cnt] = u, limit[cnt] = 0, cst[cnt] = -c;
    }

    int fr[N], fl[N], in[N], dis[N];

    pair<int, int> min_cost(int s, int t) {
        int flow = 0, cost = 0;
        while (true) { // SPFA
            queue<int> q;
            memset(dis, 0x3f, sizeof(dis));
            memset(in, 0, sizeof(in));
            fl[s] = 1e18, dis[s] = 0, q.push(s);
            while (!q.empty()) {
                int cur = q.front();
                q.pop(), in[cur] = 0;
                for (int i = hd[cur]; i; i = nxt[i]) {
                    int it = to[i], d = dis[cur] + cst[i];
                    if (limit[i] && d < dis[it]) {
                        fl[it] = min(limit[i], fl[cur]), fr[it] = i, dis[it] = d;
                        if (!in[it]) in[it] = 1, q.push(it);
                    }
                }
            }
            if (dis[t] > 1e18) return {flow, cost};
            flow += fl[t], cost += dis[t] * fl[t];
            for (int u = t; u != s; u = to[fr[u] ^ 1]) limit[fr[u]] -= fl[t], limit[fr[u] ^ 1] += fl[t];
        }
    }
} G;

int n, k;
int S, T;

void solve() {
    // int u, v, w, c;
    // G.add(u, v, w, c);
    // u - > v  流量为1 ，费用为 c
    cin >> n >> k;
    S = 0, T = n + k + 1;
    for (int i = 1; i <= n; i++) {
        G.add(S, i, 1, 0);
    }
    for (int i = 1; i <= n; i++) {
        int c;
        for (int j = 1; j <= k; j++) {
            cin >> c;
            G.add(i, n + j, 1, c);
        }
    }
    for (int i = 1; i <= k; i++) {
        int a;
        cin >> a;
        G.add(n + i, T, a, 0);
    }
    auto [flow, cost] = G.min_cost(S, T);
    cout << cost << '\n';
}


signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int _ = 1;
//    cin >> _;
    for (int o = 1; o <= _; o++) {
        solve();
    }
    return 0;
}
/*


33333 99999
133331
 */