struct node
{
    int u,v,next,cost,cap;
};

node edges[N*5];
int head[N],e;

void add(int u,int v,int cap,int cost)
{
    e++;
    edges[e].u=u;
    edges[e].v=v;
    edges[e].cap=cap;
    edges[e].cost=cost;
    edges[e].next=head[u];
    head[u]=e;
}

void Add(int u,int v,int cap,int cost)
{
    add(u,v,cap,cost);
    add(v,u,0,-cost);
}

int pre[N],F[N],C[N],visit[N];

int SPFA(int s,int t,int n)
{
    int i;
    for(i=0;i<=n;i++) F[i]=0,C[i]=INF,visit[i]=0;
    queue<int> Q;
    Q.push(s); F[s]=INF; C[s]=0;
    int u,v,cost,cap;
    while(!Q.empty())
    {
        u=Q.front();
        Q.pop();

        visit[u]=0;
        for(i=head[u];i;i=edges[i].next)
        {
            if(edges[i].cap>0)
            {
                v=edges[i].v;
                cost=edges[i].cost;
                cap=edges[i].cap;
                if(C[v]>C[u]+cost)
                {
                    C[v]=C[u]+cost;
                    F[v]=min(F[u],cap);
                    pre[v]=i;
                    if(!visit[v]) visit[v]=1,Q.push(v);
                }
            }
        }
    }
    return F[t];
}

int s,t,n,m,a[55][105],b[105],cnt[105],last[105];

int main()
{
    RD(n,m);
    int sum=0,i,j,x;
    FOR1(i,n) RD(b[i]),sum+=b[i];
    e=1;
    s=0; t=n+m+sum+1;
    FOR1(i,n)
    {
        Add(s,i,b[i],0);
        FOR1(j,m)
        {
            RD(a[i][j]);
            Add(i,n+j,1,a[i][j]);
        }
    }
    FOR1(i,m)
    {
        cnt[i]=1;
        Add(n+i,t,1,0);
        last[i]=e;
    }
    int ans=0,temp;
    while(sum--)
    {
        temp=SPFA(s,t,t);
        for(i=t;i!=s;i=edges[pre[i]].u)
        {
            x=pre[i];
            ans+=temp*edges[x].cost;
            edges[x].cap-=temp;
            edges[x^1].cap+=temp;
        }
        for(j=1;j<=m&&edges[last[j]-1].cap;j++);
        cnt[j]++;
        FOR1(i,n) Add(i,n+m+sum,1,a[i][j]*cnt[j]);
        Add(n+m+sum,t,1,0);
        last[j]=e;
    }
    PR(ans);
}