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

const int INF = 4e18;

int main() {
    int N, M;
    cin >> N >> M;

    vector<long long> R(N);
    vector<vector<vector<long long>>> C(M, vector<vector<long long>>(N, vector<long long>(N)));

    for (int i=0; i < N; i++) cin >> R[i];
    for (int i=0; i < M; i++) {
        for (int l=0; l < N; l++) {
            for (int r=l; r < N; r++) {
                cin >> C[i][l][r];
            }
        }
    }

    long long answer = LLONG_MAX;

    int FULL = (1 << N) - 1;

    for (int mask = 0; mask <= FULL; mask++) {
        long long cost = 0;
        for (int i=0; i < N; i++) {
            if (mask & (1 << i)) {
                cost += R[i];
            }
        }
        for (int col = 0; col < M; col++) {
            vector<long long> dp(1 << N, INF);
            dp[mask] = 0;

            for (int cur = 0; cur <= FULL; cur++) {
                if (dp[cur] == INF) continue;

                for (int l = 0; l < N; l++) {
                    for (int r = l; r < N; r++) {
                        int seg = 0;
                        for (int k = l; k <= r; k++) {
                            seg |= (1 << k);
                        }
                        int nxt = cur | seg;
                        dp[nxt] = min(dp[nxt], dp[cur] + C[col][l][r]);
                    }
                }
            }
            cost += dp[FULL];
            if (cost >= answer) break;
        }
        answer = min(answer, cost);
    }

    cout << answer << '\n';

    return 0;
}