// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    int n,m;cin>>n>>m;
    vector<int> Ro(n+1);
    for(int i = 1;i<=n;i++){
        cin>>Ro[i];
    }
    vector<vector<vector<int>>> Co(m+1,vector<vector<int>>(n+1,vector<int>(n+1)));
    for(int i = 1;i<=m;i++){
        for(int j = 1;j<=n;j++){
            for(int k = j;k<=n;k++){
                cin>>Co[i][j][k];
            }
        }
    }
    vector<vector<int>> Codp(m+1,vector<int>(1<<(n+1),1e17));
    for(int i = 1;i<=m;i++){
        for(int BM=0;BM<(1<<n);BM++){
            int sum=0;
            for(int I = 0;I<n;I++){
                if(BM&(1<<I))sum+=Ro[I+1];
            }
            int biztkell=((1<<(n))-1)^BM;
            vector<int> tempdp(n+1,(int)(1e17));
            tempdp[0]=0;
            for(int I = 1;I<=n;I++){
                if((biztkell&(1<<(I-1)))==0){
                    tempdp[I]=tempdp[I-1];
                }
                int jo=1e17;
                for(int j = I;j>=1;j--){
                    jo=min(jo,tempdp[j-1]);
                    tempdp[I]=min(tempdp[I],Co[i][j][I]+jo);
                }
            }
            Codp[i][BM]=tempdp[n]+(i==m?sum:0);
        }
    }
    for(int i = 1;i<=m;i++){
        for(int BM=0;BM<(1<<n);BM++){
            Codp[i][BM]+=(i>1?Codp[i-1][BM]:0LL);
        }
    }
    int mn=(int)(1e17);
    for(int i : Codp[m])mn=min(mn,i);
    cout<<mn<<endl;
}