#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 200'001;

ll c[MAXN][5][5], r[5];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> r[i];
    for (int i = 1; i <= m; i++) {
        for (int l = 1; l <= n; l++) {
            for (int r = l; r <= n; r++) {
                cin >> c[i][l][r];
            }
        }
    }
    ll ans = 1e18;
    for (int bits = 0; bits < (1<<n); bits++) {
        ll cost = 0;
        for (int i = 1; i <= n; i++) {
            if (bits&(1<<(i-1))) cost += r[i];
        }
        for (int i = 1; i <= m; i++) {
            vector<ll> dp(5, 1e18);
            dp[0] = 0;
            for (int j = 1; j <= n; j++) {
                if (bits&(1<<(j-1))) {
                    dp[j] = dp[j-1];
                }
                ll best = 1e18;
                for (int l = j; l >= 1; l--) {
                    best = min(best, dp[l-1]);
                    dp[j] = min(dp[j], c[i][l][j] + best);
                }
            }
            cost += dp[n];
        }
        ans = min(ans, cost);
    }
    cout << ans << "\n";
    return 0;
}