#include <bits/stdc++.h>
using namespace std;
#define C const
#define U unsigned
#define SC static
#define CE constexpr
#define TL template
#define TN typename
#define OP operator
#define pb push_back
#define ft first
#define sd second
#define mi (l + (r - l) / 2)
#define TTT TL<TN T = I>
#define TTI TL<TN It>
#define BE(v) v.begin(), v.end()
#define VD void
#define BL bool
#define CH char
#define I int
#define LL long long
#define II __int128
#define D double
#define STR string
using PII = pair<I, I>;
TTT using V = vector<T>;
TTT using Heap = priority_queue<T, V<T>, greater<T>>;

#define FORX(v) for(auto& x : v)
#define FOR(i, b, e)  for(auto i = b, _e = (decltype(i))e;i != _e; ++i)
#define FORR(i, b, e) for(auto i = b, _e = (decltype(i))e;i != _e; --i)
#define FORV(v, i) for (I i = 0, _n = v.size(), x = _n ? v[0] : 0;i < _n;x = v[++i])
#define FUNC(T, f, ...) function<T(__VA_ARGS__)> f = [&](__VA_ARGS__)->T

#define DR(T, ...) T __VA_ARGS__; R(__VA_ARGS__);
TTT VD R(T& x) { cin >> x; }
TTT T R() { DR(T, x); return x; }
TL<TN T, TN... A> VD R(T& x, A&... a) { R(x), R(a...); }
CE CH LF = '\n', SP = ' ';
TL<CH s = LF> VD W() { cout << s; }
TL<CH s = LF, TN T> VD W(C T& x) { cout << x << s; }
TL<CH s = LF, TN T, TN... A> VD W(C T& x, C A&... a) { W<SP>(x), W<s>(a...); }

TTT CE T inf() { return numeric_limits<T>::max() / 2; }
TTT VD setmin(T& a, C T& b) { if (b < a)a = b; }
TTT VD setmax(T& a, C T& b) { if (a < b)a = b; }

TL<TN T, TN S> struct MCMF//Minimum Cost Maximum Flow, O(m * logm * mf)
{
	struct EG { I t; T c; S v; };
	I n; V<V<I>> e; V<EG> a; V<S> h, ds; V<I> vs; V<I> r;
	MCMF(I n) :n(n), e(n), h(n, inf<S>()), ds(n), vs(n), r(n) {}
	VD ade(I u, I v, T w, S x) { e[u].pb(a.size()), a.pb({ v,w,x }); }
	VD add(I u, I v, T w, S x) { ade(u, v, w, x), ade(v, u, 0, -x); }
	VD spfa(I s)
	{
		V<I> q{ s }; I hd = 0;
		h[s] = 0; vs[s] = 1;
		while (hd < q.size())
		{
			I p = q[hd++]; vs[p] = 0;
			FORX(e[p])
			{
				EG& eg = a[x];
				if (!eg.c || h[eg.t] <= h[p] + eg.v)continue;
				h[eg.t] = h[p] + eg.v;
				if (!vs[eg.t])vs[eg.t] = 1, q.pb(eg.t);
			}
		}
	}
	I dijkstra(I s, I t)
	{
		Heap<pair<S, I>> q;
		fill(BE(ds), inf<S>()); fill(BE(vs), 0);
		q.push({ 0,s }); ds[s] = 0;
		while (q.size())
		{
			I p = q.top().sd; q.pop();
			if (vs[p]++)continue;
			FORX(e[p])
			{
				I t = a[x].t; S v = a[x].v + h[p] - h[t];
				if (!a[x].c || ds[t] <= ds[p] + v)continue;
				ds[t] = ds[p] + v, r[t] = x;
				q.push({ ds[t],t });
			}
		}
		return vs[t];
	}
	pair<T, S> OP()(I s, I t)
	{
		spfa(s); T ansf = 0; S ansv = 0;
		while (dijkstra(s, t))
		{
			T mc = inf<T>();
			FOR(i, 0, n)h[i] += ds[i];
			for (I p = t; p != s;p = a[r[p] ^ 1].t)
				setmin(mc, a[r[p]].c);
			for (I p = t; p != s;p = a[r[p] ^ 1].t)
				a[r[p]].c -= mc, a[r[p] ^ 1].c += mc;
			ansf += mc, ansv += mc * h[t];
		}
		return { ansf, ansv };
	}
};

VD test()
{
	DR(I, n, k);
	++n;++k;
	MCMF<I, I> mf(n + k);
	FOR(i, 1, n)
	{
		mf.add(0, i, 1, 0);
		FOR(j, 1, k)mf.add(i, n + j, 1, R());
	}
	FOR(i, 1, k)mf.add(n + i, n, R(), 0);
	W(mf(0, n).sd);

}

I main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	if (fopen("test.in", "r"))
	{
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	I t = 1;
	// R(t);
	while (t--)test();
	return 0;
}