#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
#define int long long
#define i128 __int128
#define ll long long
#define ull unsigned long long
#define ld double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
#define pcnt(x) __builtin_popcount(x)
using namespace std;
void file_IO() {
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
bool M1;
const int N=5e4+5,M=15;
int match[N],c[N][M],a[M];
struct del_heap {
	priority_queue<PII,vector<PII>,greater<PII>> heap;
	void push(PII val) {
		heap.push(val);
	}
	void pop(int x=0) {
		while(!heap.empty()&&match[heap.top().second]!=x)
			heap.pop();		
	}
	PII top() {
		if(heap.empty())
			return make_pair(-1,-1);
		return heap.top();
	}
}; del_heap f[M][M],g[M];
int d[M][M],dis[M],pre[M];
bool inq[M];
queue<int> q;
void spfa(int n) {
	while(!q.empty()) {
		int u=q.front(); q.pop();
		inq[u]=false;
		rep(v,1,n) {
			int w=d[u][v];
			if(dis[v]>dis[u]+w) {
				dis[v]=dis[u]+w;
				pre[v]=u;
				if(!inq[v]) {
					q.push(v);
					inq[v]=true;
				}
			}
		}
	}
}
void solve() {
	int n,k;
	scanf("%lld%lld",&n,&k);
	rep(i,1,n) {
		rep(j,1,k) {
			scanf("%lld",&c[i][j]);
			g[j].push(make_pair(c[i][j],i));
		}
	}
	rep(i,1,k)
		scanf("%lld",&a[i]);
	int testcase=n,res=0;
	while(testcase--) {
		cl(dis,0x3f);
		cl(d,0x3f);
		cl(inq,false);
		cl(pre,0);
		while(!q.empty())
			q.pop();
		rep(i,1,k) {
			g[i].pop();
			int x=g[i].top().first;
			if(x!=-1) {
				dis[i]=x;
				q.push(i);
				inq[i]=true;
			}
		}
		rep(i,1,k) {
			rep(j,1,k) {
				if(i!=j) {
					f[i][j].pop(i);
					int x=f[i][j].top().first;
					if(x!=-1)
						d[i][j]=x;
				}
			}
		}
		spfa(k);
		int u=0;
		rep(i,1,k) {
			if(a[i]&&dis[u]>dis[i])
				u=i;
		}
		--a[u];
		res+=dis[u];
		while(u) {
			int v=pre[u],x=v? f[v][u].top().second:g[u].top().second;
			match[x]=u;
			rep(j,1,k) {
				if(j!=u)
					f[u][j].push(make_pair(c[x][j]-c[x][u],x));
			}
			u=v;
		}
	}
	printf("%lld\n",res);
}
bool M2;
signed main() {
	//file_IO();
	int testcase=1;
	//scanf("%d",&testcase);
	while(testcase--)
		solve();
	cerr<<"used time = "<<1000*clock()/CLOCKS_PER_SEC<<"ms\n";
	cerr<<"used memory = "<<(&M1-&M2)/1024/1024<<"MB\n";
	return 0;
}