#include<set>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define trav(u,i) for(int i=front[u];i;i=e[i].nxt)

 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)

 using namespace std;

 typedef long long ll;

 const int N = 2e3+;

 const int inf = 1e9;

 ll read() {

     char c=getchar();

     ll f=,x=;

     while(!isdigit(c)) {

         if(c=='-') f=-; c=getchar();

     }

     while(isdigit(c))

         x=x*+c-'',c=getchar();

     return x*f;

 }

 struct Edge {

     int u,v,cap,flow,cost;

 };

 struct MCMF {

     int n,m,s,t;

     int a[N],p[N],inq[N],d[N];

     vector<Edge> es;

     vector<int> g[N];

     queue<int> q;

     void init(int n) {

         this->n=n;

         es.clear();

         FOR(i,,n) g[i].clear();

     }

     void AddEdge(int u,int v,int w,int c) {

         es.push_back((Edge){u,v,w,,c});

         es.push_back((Edge){v,u,,,-c});

         int m=es.size();

         g[u].push_back(m-);

         g[v].push_back(m-);

     }

     int spfa(int s,int t,int& flow,int& cost) {

         memset(inq,,sizeof(inq));

         FOR(i,,n) d[i]=inf;

         inq[s]=; d[s]=; a[s]=inf; p[s]=;

         q.push(s);

         while(!q.empty()) {

             int u=q.front(); q.pop(); inq[u]=;

             FOR(i,,(int)g[u].size()-) {

                 Edge& e=es[g[u][i]];

                 int v=e.v;

                 if(d[v]>d[u]+e.cost && e.cap>e.flow) {

                     d[v]=d[u]+e.cost;

                     a[v]=min(a[u],e.cap-e.flow);

                     p[v]=g[u][i];

                     if(!inq[v])

                         inq[v]=,q.push(v);

                 }

             }

         }

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

         flow+=a[t]; cost+=a[t]*d[t];

         for(int x=t;x!=s;x=es[p[x]].u) {

             es[p[x]].flow+=a[t];

             es[p[x]^].flow-=a[t];

         }

         return ;

     }

     void mcmf(int s,int t,int&flow,int&cost) {

         flow=cost=;

         while(spfa(s,t,flow,cost)) ;

     }

 } mc;

 int n,m,in[N];

 int main()

 {

     n=read(),m=read();

     int s=,t=n+n+,S=t+,T=S+;

     mc.init(T+);

     mc.AddEdge(S,s,m,);

     FOR(i,,n) {

         int v=read();

         mc.AddEdge(s,i,inf,);

         in[i]-=v,in[i+n]+=v;

     }

     FOR(i,,n) FOR(j,i+,n) {

         int x=read();

         if(x!=-) mc.AddEdge(i+n,j,inf,x);

     }

     FOR(i,,n+n) {

         if(in[i]>) mc.AddEdge(S,i,in[i],);

         if(in[i]<) mc.AddEdge(i,T,-in[i],);

     }

     int flow,cost;

     mc.mcmf(S,T,flow,cost);

     printf("%d\n",cost);

     return ;

 }