#include<algorithm> #include<iostream> #include<cstring> #include<cstdlib> #include<cstdio> #define inf 0x7fffffff using namespace std; inline int read(){ int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } struct edge{int from,to,next,v,c;}e[3000001]; int t[45][105]; int n,m,cnt=1,ans,tot,T=100001,c[45],head[100005],from[100005],dis[100005],q[100005]; bool inq[100005]; inline void ins(int u,int v,int w,int c){ e[++cnt]=(edge){u,v,head[u],w,c};head[u]=cnt; e[++cnt]=(edge){v,u,head[v],0,-c};head[v]=cnt; } inline bool spfa(){ int t=0,w=1; memset(inq,0,sizeof(inq)); for(int i=0;i<=T;i++)dis[i]=inf; dis[0]=0;q[0]=0;inq[0]=1; while(t!=w){ int now=q[t++];if(t==T)t=0; for(int i=head[now];i;i=e[i].next) if(e[i].v&&dis[e[i].to]>dis[now]+e[i].c){ dis[e[i].to]=dis[now]+e[i].c; from[e[i].to]=i; if(!inq[e[i].to]){ inq[e[i].to]=1; q[w++]=e[i].to; if(w==T)w=0; } } inq[now]=0; } if(dis[T]==inf)return 0; return 1; } inline void mcf(){ int x=inf,a,b,y; for(int i=from[T];i;i=from[e[i].from]){ x=min(x,e[i].v); if(e[i].from==0){ y=e[i].to; a=(y-1)/tot+1; b=y%tot+1; } } for(int i=from[T];i;i=from[e[i].from]){ e[i].v-=x;e[i^1].v+=x;ans+=e[i].c*x; } for(int i=1;i<=m;i++) ins((a-1)*tot+b,n*tot+i,1,b*t[i][a]); } int main(){ m=read();n=read(); for(int i=1;i<=m;i++){ c[i]=read(); tot+=c[i]; } for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) t[i][j]=read(); for(int i=1;i<=n*tot;i++) ins(0,i,1,0); for(int i=1;i<=m;i++) ins(n*tot+i,T,c[i],0); for(int i=1;i<=n;i++) for(int k=1;k<=m;k++) ins((i-1)*tot+1,n*tot+k,1,t[k][i]); while(spfa())mcf(); printf("%d",ans); return 0; }