#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=50010;
const ll inf=0x7fffffffffffffff;
int n,k;
ll c[N][11],dis[11][11];
int pre[11][11];
struct Que{
	set<pll>s;
	int pos(){return s.begin()->se;}
	void push(pll x){s.insert(mp(-x.fi,x.se));}
	void pop(pll x){s.erase(mp(-x.fi,x.se));}
}Q[11][11];
int to[N],re[N];
ll ans;
void spfa(int S){
	queue<int>q;
	for(int i=1;i<=k;i++){
		pre[S][i]=0;
		dis[S][i]=-inf;
	}
	dis[S][S]=0;
	q.push(S);
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=1;i<=k;i++)if(!Q[x][i].s.empty()){
			ll va=Q[x][i].s.begin()->fi;va=-va;
			if(dis[S][i]<dis[S][x]+va){
				dis[S][i]=dis[S][x]+va;
				pre[S][i]=x;
				q.push(i);
			}
		}
	}
}
signed main(){
	#ifdef do_while_true
		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,k);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=k;j++){
			read(c[i][j]);
			c[i][j]=-c[i][j];
		}
	for(int i=1;i<=k;i++)read(re[i]);
	for(int i=1;i<=k;i++)
		for(int j=1;j<=k;j++)
			if(i!=j)
				dis[i][j]=-inf;
	for(int i=1;i<=n;i++){
		ll mx=-inf;
		int p,q;
		for(int j=1;j<=k;j++){
			for(int l=1;l<=k;l++)if(dis[j][l]!=-inf){
				if(re[l]&&c[i][j]+dis[j][l]>mx){
					mx=c[i][j]+dis[j][l];
					p=j;q=l;
				}
			}
		}
		re[q]--;
		vpii vec;
		while(q){
			if(pre[p][q])
				vec.pb(mp(Q[pre[p][q]][q].pos(),q));
			else vec.pb(mp(i,p));
			q=pre[p][q];
		}
		for(auto t:vec){
			int x=t.fi,v=t.se;
			if(to[x]){
				for(int j=1;j<=k;j++)if(j!=to[x]){
					Q[to[x]][j].pop(mp(c[x][j]-c[x][to[x]],x));
				}
			}
			to[x]=v;
			for(int j=1;j<=k;j++)if(j!=to[x]){
				Q[to[x]][j].push(mp(c[x][j]-c[x][to[x]],x));
			}
		}
		for(int j=1;j<=k;j++)spfa(j);
		ans+=mx;
	}
	ans=-ans;
	cout<<ans<<'\n';
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}