//By hzwer
 1 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #define inf 0x7fffffff

 #define T 100001

 using namespace std;

 int n,m,tot,cnt=,ans,t[][];

 int c[],d[],q[],from[],head[];

 bool inq[];

 struct edge{int from,to,next,c,v;}e[];

 void ins(int u,int v,int w,int c)

 {

     cnt++;

     e[cnt].from=u;e[cnt].to=v;

     e[cnt].next=head[u];head[u]=cnt;

     e[cnt].c=c;e[cnt].v=w;

 }

 void insert(int u,int v,int w,int c)

 {ins(u,v,w,c);ins(v,u,,-c);}

 bool spfa()

 {

     for(int i=;i<=T;i++)d[i]=inf;

     int t=,w=;d[]=;inq[]=;q[]=;

     while(t!=w)

     {

         int now=q[t];t++;if(t==T)t=;

         for(int i=head[now];i;i=e[i].next)

             if(e[i].v&&d[e[i].to]>d[now]+e[i].c)

             {

                 d[e[i].to]=d[now]+e[i].c;from[e[i].to]=i;

                 if(!inq[e[i].to])

                 {inq[e[i].to]=;q[w++]=e[i].to;if(w==T)w=;}

             }

         inq[now]=;

     }

     if(d[T]==inf)return ;

     return ;

 }

 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==)

         {y=e[i].to;a=(y-)/tot+;b=y%tot+;}

     }

     for(int i=from[T];i;i=from[e[i].from])

     {e[i].v-=x;e[i^].v+=x;ans+=e[i].c*x;}

     for(int i=;i<=m;i++)

         insert((a-)*tot+b,n*tot+i,,b*t[i][a]);

 }

 int main()

 {

     scanf("%d%d",&m,&n);

     for(int i=;i<=m;i++)

     {

         scanf("%d",&c[i]);

         tot+=c[i];

     }

     for(int i=;i<=m;i++)

         for(int j=;j<=n;j++)

             scanf("%d",&t[i][j]);

     for(int i=;i<=n*tot;i++)

         insert(,i,,);

     for(int i=;i<=m;i++)

         insert(n*tot+i,T,c[i],);

     for(int i=;i<=n;i++)

         for(int k=;k<=m;k++)

             insert((i-)*tot+,n*tot+k,,t[k][i]);

     while(spfa())mcf();

     printf("%d",ans);

     return ;

 }