#include <bits/stdc++.h>

using namespace std;

const int INF = 2e9 + 7;

int main(){
    int n, m;
    cin >> n >> m;

    int ans = 0;
    vector<int> sor(n);
    for(int &x : sor){
        cin >> x;
        ans += x;
    }

    vector<vector<vector<int>>> oszlop(n, vector<vector<int>>(m, vector<int>(n, INF)));
    for(int j = 0; j < m; j++){
        for(int i = 0; i < n; i++){
            for(int k = i; k < n; k++){
                cin >> oszlop[i][j][k];
            }
        }
    }

    for(int j = 0; j < m; j++){
        for(int i = 0; i < n; i++){
            for(int k = n - 1; k >= 0; k--){
                int a = INF, b = INF;

                if(0 < i - 1) a = oszlop[i - 1][j][k];

                if(k + 1 < n) b = oszlop[i][j][k + 1];

                oszlop[i][j][k] = min(oszlop[i][j][k], min(a, b));
            }
        }
    }

    vector<vector<int>> dp(n + 1, vector<int>(m, INF));

    for(int mask = 0; mask < (1 << n); mask++){
        dp[n][m - 1] = 0;
        for(int j = m - 1; j >= 0; j--){
            if(j != m - 1){
                dp[n][j] = dp[0][j + 1];
            }

            for(int i = n - 1; i >= 0; i--){

                if(mask & (1 << i)){
                    dp[i][j] = min(dp[i][j], dp[i + 1][j]);
                }

                for(int k = i; k < n; k++){
                    dp[i][j] = min(dp[i][j], dp[k + 1][j] + oszlop[i][j][k]);
                }
            }
        }

        int plusz = 0;
        for(int i = 0; i < n; i++){
            if(mask & (1 << i)){
                plusz += sor[i];
            }
        }

        //cout << mask << " " << dp[0][0] + plusz << "\n";

        /*for(auto x : dp){
            for(int y : x){
                cout << y << " ";
            }
            cout << "\n";
        }*/

        ans = min(ans, dp[0][0] + plusz);
    }

    cout << ans << "\n";
}