#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define N 49
#define M 109
#define P 809
#define R register
using namespace std;
queue<int>q;
int p[N],head[M*P],tot=1,dis[M*P],pre[M*P],fl[M*P],ans,n,m,sum,a[N][M],tim[M*P],id[M],be[M*P];
bool vis[M*P];
inline int rd(){int x=0;char c=getchar();bool f=0;while(!isdigit(c)){if(c=='-')f=1;c=getchar();}while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}return f?-x:x;
}
struct edge{int n,to,l,f;}e[N*M*P*2];
inline void add(int u,int v,int l,int f){e[++tot].n=head[u];e[tot].to=v;head[u]=tot;e[tot].l=l;e[tot].f=f;e[++tot].n=head[v];e[tot].to=u;head[v]=tot;e[tot].l=0;e[tot].f=-f;
}
inline bool spfa(int s,int t){memset(dis,0x3f,sizeof(dis));q.push(s);dis[s]=0;fl[s]=2e9;while(!q.empty()){int u=q.front();q.pop();vis[u]=0;//    cout<<u<<" "<<dis[u]<<endl;for(R int i=head[u];i;i=e[i].n){int v=e[i].to;if(e[i].l&&dis[v]>dis[u]+e[i].f){dis[v]=dis[u]+e[i].f;pre[v]=i;fl[v]=min(fl[u],e[i].l);if(!vis[v]){vis[v]=1;q.push(v);}}} }return dis[t]!=0x3f3f3f3f;
}
inline void calc(int s,int t){int x=t;while(x!=s){int i=pre[x];e[i].l-=fl[t];e[i^1].l+=fl[t];x=e[i^1].to;}ans+=dis[t]*fl[t];
}
int main(){n=rd();m=rd();for(R int i=1;i<=n;++i)p[i]=rd(),sum+=p[i];for(R int i=1;i<=n;++i)for(R int j=1;j<=m;++j)a[i][j]=rd();int now=n;for(R int i=1;i<=m;++i)for(R int j=1;j<=sum;++j){++now;tim[now]=j==1?1:tim[now-1]+1;if(j==1)id[i]=now;be[now]=i;}for(R int i=1;i<=n;++i)for(R int j=1;j<=m;++j)add(i,id[j],1,a[i][j]);for(R int i=1;i<=m;++i)add(id[i],now+1,1,0);for(R int i=1;i<=n;++i)add(0,i,p[i],0);while(spfa(0,now+1)){calc(0,now+1);int x=e[pre[now+1]^1].to;x++;add(x,now+1,1,0);for(int i=1;i<=n;++i)add(i,x,1,tim[x]*a[i][be[x]]);}cout<<ans;return 0;
}