#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const long long INF = 1e18;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<long long> R(n);
    for (int i = 0; i < n; i++) cin >> R[i];
    vector<vector<vector<long long>>> col_prices(m, vector<vector<long long>>(n + 1, vector<long long>(n + 1)));

    for (int j = 0; j < m; j++) {
        for (int l = 1; l <= n; l++) {
            for (int r = l; r <= n; r++) {
                cin >> col_prices[j][l][r];
            }
        }
    }

    long long best_total = INF;
    for (int g = 0; g < (1 << n); g++) {
        long long cost = 0;
        for (int i = 0; i < n; i++) {
            if ((g >> i) & 1) cost += R[i];
        }
        for (int j = 0; j < m; j++) {
            vector<long long> dp(n + 1, INF);
            dp[0] = 0;
            for (int r = 1; r <= n; r++) {
                if ((g >> (r - 1)) & 1) {
                    dp[r] = dp[r - 1];
                }
                for (int l = 1; l <= r; l++) {
                    dp[r] = min(dp[r], dp[l - 1] + col_prices[j][l][r]);
                }
            }
            cost += dp[n];
        }

        if (cost < best_total) best_total = cost;
    }

    cout << best_total << endl;
    return 0;
}