#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,m;
    cin>>n>>m;

    vector<ll> rcost(n);
    for (auto &i : rcost) cin>>i;
    vector<vector<vector<ll>>> ccost(m, vector<vector<ll>> (n+1, vector<ll> (n+1, -1)));
    for (auto &c : ccost){
        for (int i=1;i<=n;i++){
            for (int j=i;j<=n;j++){
                cin>>c[i][j];
            }
        }
    }
    

    ll ans=LLONG_MAX;

    for (int bitmask=0;bitmask<(1<<n);bitmask++){
        ll cost=0;
        for (int i=0;i<n;i++) if ((bitmask>>i) & 1) cost+=rcost[i];
        for (int i=0;i<m;i++){
            vector<ll> dp(n+1, LLONG_MAX);
            dp[0]=0;
            for (int j=1;j<=n;j++) {
                if ((bitmask>>(j-1)) & 1) dp[j]=dp[j-1];
                else {
                    ll best = 1e18;
                    for (int l = j; l >= 1; l--) {
                        best = min(best, dp[l-1]);
                        dp[j] = min(dp[j], ccost[i][l][j] + best);
                    }
                }
            }
            cost+=dp[n];
        }
        ans=min(ans,cost);
    }
    cout<<ans;
}