#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, DUT, Da Nang */

const ll INF = 1e9;
const int N = 1e5 + 10;

struct MFMC {
	//O(n ^ 2 * m ^ 2)

	struct Edge {
		int u, v;
		ll cap, cost;

		Edge() : u(), v(), cap(), cost() {}
		Edge(int _u, int _v, ll _cap, ll _cost) : u(_u), v(_v), cap(_cap), cost(_cost) {}
	};

	vector<Edge> ed;
	vector<vector<int>> g;
	vector<ll> dist;
	vector<bool> inq;
	vector<int> p;
	int n;
	int S, T;

	MFMC() : n(), S(), T() {}
	MFMC(int _n, int _S, int _T) {
		n = _n;
		S = _S;
		T = _T;
		g.resize(n + 3);
		dist.resize(n + 3);
		inq.resize(n + 3);
		p.resize(n + 3);
		ed = vector<Edge>();
		for(int i = 0; i < n; i++) g[i].clear();
	}

	void addEdge(int u, int v, ll cap, ll cost) {
		g[u].pb(ed.size());
		ed.pb(Edge(u, v, cap, cost));
		g[v].pb(ed.size());
		ed.pb(Edge(v, u, 0, -cost));
	}

	bool spfa() {
		for(int i = 0; i <= n; i++) {
			dist[i] = INF;
			inq[i] = false;
			p[i] = -1;
		}		

		dist[S] = 0;
		queue<int> q;
		q.push(S); inq[S] = true;

		while(!q.empty()) {
			int u = q.front(); q.pop(); inq[u] = false;
			for(int i = 0; i < (int)g[u].size(); i++) {
				Edge e = ed[g[u][i]];
				if(!e.cap) continue;
				if(dist[e.v] > dist[u] + e.cost) {
					dist[e.v] = dist[u] + e.cost;
					p[e.v] = g[u][i];
					if(!inq[e.v]) {
						q.push(e.v);
						inq[e.v] = true;
					}
				}
			}
		}

		return (p[T] >= 0);
	}

	pll Flow() {
		//return (maxflow, cost)
		ll flow = 0, cost = 0;
		while(spfa()) {
			int u = T;

			ll f = INF;
			while(u != S) {
				f = min(f, ed[p[u]].cap);
				u = ed[p[u]].u;
			}

			flow += f; cost += f * dist[T];
			u = T;
			while(u != S) {
				ed[p[u]].cap -= f;
				ed[p[u] ^ 1].cap += f;
				u = ed[p[u]].u;
			}
		}

		return make_pair(flow, cost);
	}
};

void BaoJiaoPisu() {
	int n, k; cin >> n >> k;
	int S = n + k + 1, T = n + k + 2;
	MFMC G = MFMC(n + k + 5, S, T);
	for(int i = 1; i <= n; i++) {
		G.addEdge(S, i, 1, 0);
		for(int j = 1; j <= k; j++) {
			int x; cin >> x;
			G.addEdge(i, j + n, 1, x);
		}
	}
	for(int i = 1; i <= k; i++) {
		int x; cin >> x;
		G.addEdge(i + n, T, x, 0);
	}

	cout << G.Flow().se;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else 
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}