// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
mt19937 gen(time(0));
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;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353;
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%m;x=1ll*x*x%m;}
	return res;
}
const int N=5e4+3;
const int K=10;
priority_queue<pii,vector<pii>,greater<pii>>q1[K*K],q2[K];
// clang-format on
int n,m,c[N][K],a[K],mh[N];
ll ans,f[K][K],pre[K],dis[K];
inline void add(int i,int j){
	if(~mh[i])++a[mh[i]];
	--a[mh[i]=j];
	rep(k,0,m-1)if(k!=j)q1[j*m+k].push(P(c[i][k]-c[i][j],i));
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	n=read(),m=read();
	rep(i,1,n)rep(j,0,m-1)c[i][j]=read();
	rep(j,0,m-1){
		a[j]=read();
		rep(i,1,n)q2[j].push(P(c[i][j],i));
	}
	rep(i,1,n)mh[i]=-1;
	rep(_,1,n){
		rep(j,0,m-1){
			rep(k,0,m-1)if(k!=j){
				int t=k*m+j;
				while(!q1[t].empty() && mh[q1[t].top().se]!=k)q1[t].pop();
				f[j][k]=q1[t].empty()?1e15:q1[t].top().fi;
			}
		}
		static bool inq[K];queue<int>q;
		rep(j,0,m-1){
			pre[j]=0;
			if(a[j])dis[j]=0,q.push(j),inq[j]=1;
			else dis[j]=1e15,inq[j]=0;
		}
		while(!q.empty()){
			int u=q.front();q.pop();inq[u]=0;
			rep(j,0,m-1)if(j!=u && dis[j] > dis[u] + f[u][j]){
				dis[j] = dis[u] + f[u][j];pre[j]=u;
				if(!inq[j])inq[j]=1,q.push(j);
			}
		}
		ll mn=1e15;int lp,rp;
		rep(j,0,m-1){
			while(!q2[j].empty() && ~mh[q2[j].top().se])q2[j].pop();
			int i=q2[j].top().se;
			if(c[i][j] + dis[j] < mn){
				mn = dis[j] + c[i][j];
				lp=i,rp=j;
			}
		}
		ans += mn;
		for(int u=rp;pre[u];u=pre[u]){
			int t=u*m+pre[u];
			add(q1[t].top().se,pre[u]);
		}
		add(lp,rp);
	}
	cout<<ans;
    return 0;
}