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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;
    vector<long long> R(N);
    for (int i = 0; i < N; i++) cin >> R[i];

    vector<vector<long long>> C(M, vector<long long>(N*(N+1)/2));
    for (int j = 0; j < M; j++)
        for (int k = 0; k < N*(N+1)/2; k++)
            cin >> C[j][k];

    int full = (1 << N) - 1;
    vector<long long> dp(1 << N, LLONG_MAX);
    dp[0] = 0;

    for (int j = 0; j < M; j++) {
        vector<long long> new_dp = dp;
        int idx = 0;
        for (int l = 0; l < N; l++) {
            for (int r = l; r < N; r++) {
                int mask = 0;
                for (int i = l; i <= r; i++) mask |= (1 << i);
                for (int s = 0; s < (1 << N); s++) {
                    if (dp[s] != LLONG_MAX) {
                        new_dp[s | mask] = min(new_dp[s | mask], dp[s] + C[j][idx]);
                    }
                }
                idx++;
            }
        }

        // ALSO consider painting full rows in this column step
        for (int s = 0; s < (1 << N); s++) {
            if (new_dp[s] == LLONG_MAX) continue;
            for (int i = 0; i < N; i++) {
                int ns = s | (1 << i);
                new_dp[ns] = min(new_dp[ns], new_dp[s] + R[i]);
            }
        }

        dp = new_dp;
    }

    cout << dp[full] << "\n";
}