#include<cstdio>
#include<algorithm>
#define MN 40001
using namespace std;

int read_p,read_ca,read_f;
inline int read(){
    read_p=0;read_ca=getchar();read_f=1;
    while(read_ca<‘0‘||read_ca>‘9‘) read_f=read_ca==‘-‘?-1:read_f,read_ca=getchar();
    while(read_ca>=‘0‘&&read_ca<=‘9‘) read_p=read_p*10+read_ca-48,read_ca=getchar();
    return read_p*read_f;
}
const int INF=1e9;
struct na{int y,z,ne;}b[MN*10];
int n,m,map[101][101],nu[101][101],a[101],num=1,no=0,S,T,mmh=0,g[MN],c[MN],d[MN],l[MN];
inline void in(int x,int y,int z){b[++num].y=y;b[num].z=z;b[num].ne=l[x];l[x]=num;}
inline void add(int x,int y,int z){in(x,y,z);in(y,x,0);}
inline int min(int a,int b){return a<b?a:b;}
int sap(int x,int f){
    if (x==T) return f;
    int h=0,q;
    for (int i=d[x];i;i=b[i].ne)
    if (b[i].z&&g[b[i].y]+1==g[x]){
        q=sap(b[i].y,min(b[i].z,f-h));
        h+=q;b[i].z-=q;b[i^1].z+=q;
        if (h==f||g[S]==no) return h;
    }
    if (!(--c[g[x]])) g[S]=no;d[x]=l[x];c[++g[x]]++;
    return h;
}
int main(){
    register int i,j;
    n=read();m=read();
    S=++no;T=++no;
    
    for (i=1;i<=n;i++)
    for (j=i;j<=n;j++) nu[i][j]=++no;
    
    for (i=1;i<=n;i++)
    for (j=i+1;j<=n;j++)
    add(nu[i][j],nu[i][j-1],INF),add(nu[i][j],nu[i+1][j],INF);
    
    for (i=1;i<=n;i++){
        a[i]=read();map[i][i]-=a[i];
        add(nu[i][i],no+a[i],INF);
    }
    for (i=1;i<=n;i++)
    for (j=i;j<=n;j++) if ((map[i][j]+=read())>0) add(S,nu[i][j],map[i][j]),mmh+=map[i][j];else add(nu[i][j],T,-map[i][j]);
    if (m) for (i=1;i<=1000;i++) add(no+i,T,i*i);no+=1000;
    
    for (;g[S]<no;mmh-=sap(S,INF));
    printf("%d\n",mmh);
}