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

const long long INF = 4e18;

int row_cost[4];
int col_cost[100000][4][4];

int main() {

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

    for (int i=0; i < n; i++) {
        cin >> row_cost[i];
    }

    for (int i=0; i < m; i++) {
        for (int l = 0; l < n; l++) {
            for (int r = l; r < n; r++) {
                cin >> col_cost[i][l][r];
            }
        }
    }

    int full_mask = (1 << n) - 1;
    long long answer = INF;

    for (int mask = 0; mask <= full_mask; mask++) {
        long long cost = 0;
        for (int row = 0; row < n; row++) {
            if (mask & (1 << row)) {
                cost += row_cost[row];
            }
        }

        for(int col = 0; col < m; col++) {
            vector<long long> dp(n + 1, INF);
            dp[0] = 0;

            for (int i = 1; i <= n; i++) {
                if (mask & (1 << (i - 1))) {
                    dp[i] = dp[i - 1];
                } else {
                    for (int l = 0; l <= i - 1; l++) {
                        for (int r = l; r < n; r++) {
                            if (i - 1 >= l && i - 1 <= r) {
                                dp[i] = min(dp[i], dp[l] + col_cost[col][l][r]);
                            }
                        }
                    }
                }
            }
            cost += dp[n];
        }
        answer = min(answer, cost);
    }

    cout << answer << '\n';

    return 0;
}