#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>using namespace std;const int maxn=50;
const int maxm=110;
const int maxp=100010;
const int INF=0x3f3f3f3f;struct Node{int data,next,low,cost;
}node[maxp*maxn*2];#define now node[point].data
#define www node[point].low
#define ccc node[point].cost
#define then node[point].nextint n,m,cnt,ans;
int s,t,Idex,tot;
int head[maxp];
int c[maxp],ind[maxp],ink[maxp];
int dis[maxp],pre[maxp];
int a[maxm][maxm];
bool inq[maxp];
deque<int >q;void add(int u,int v,int w,int c){node[cnt].data=v;node[cnt].next=head[u];node[cnt].low=w;node[cnt].cost=c;head[u]=cnt++;node[cnt].data=u;node[cnt].next=head[v];node[cnt].low=0;node[cnt].cost=-c;head[v]=cnt++;
}bool SPFA(){int x,Low=INF,ta,tb;memset(dis,0x3f,sizeof(dis));q.push_back(s);dis[s]=0;pre[s]=pre[t]=-1;while(!q.empty()){x=q.front();q.pop_front();inq[x]=false;for(int point=head[x];point!=-1;point=then)if(www && dis[now]>dis[x]+ccc){dis[now]=dis[x]+ccc;pre[now]=point^1;if(!inq[now]){inq[now]=true;if(q.empty() || dis[q.front()]>dis[now])q.push_front(now);elseq.push_back(now);}}}if(pre[t]<0) return false;for(int point=pre[t];point!=-1;point=pre[now]){if(now==s){x=node[point^1].data;ta=(x-1)/tot+1;tb=x%tot+1;}Low=min(Low,min(Low,node[point^1].low));}for(int point=pre[t];point!=-1;point=pre[now])node[point^1].low-=Low,www+=Low;for(int i=1;i<=m;i++)add((ta-1)*tot+tb,n*tot+i,1,tb*a[ta][i]);ans+=Low*dis[t];return true;
}int main(){
#ifndef ONLINE_JUDGEfreopen("2879.in","r",stdin);freopen("2879.out","w",stdout);
#endifscanf("%d%d",&m,&n);for(int i=1;i<=m;i++) scanf("%d",&c[i]),tot+=c[i];for(int i=1;i<=m;i++)for(int j=1;j<=n;j++)scanf("%d",&a[j][i]);t=n*tot+m+1;for(int i=s;i<=t;i++) head[i]=-1;for(int i=1;i<=n*tot;i++) add(s,i,1,0);for(int i=1;i<=m;i++)add(n*tot+i,t,c[i],0);for(int i=1;i<=n;i++)for(int k=1;k<=m;k++)add((i-1)*tot+1,n*tot+k,1,a[i][k]);while(SPFA());printf("%d",ans);return 0;
}