#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
//#pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*
 *
 * notes:
 *
 * int64_t
 * stoi(string s) -> string to int
 * to_string() -> int (or else) to string
 *
 * vector declaration:
 * vector<ll> v(n, 0)
 * vector<vector<ll>> v(n, vector<ll>(n, 0));
 *
 * {if statement} ? {truth value} : {false value}
 *
 * set lower bound/upper bound:
 * 	// . . . m1 . . . d . . . . m2
 *    auto m1_it = b.lower_bound(d);
 *    advance(m1_it, -1);
 *    m1 = *m1_it;
 *	m2 = *b.upper_bound(d);
 *
 * #ifdef LOCAL
 *    freopen("in.txt","r",stdin);
 *    freopen("out.txt","w",stdout);
 * #endif
 *
 * constexpr auto lcm(auto x, auto... xs)
 * {
 *	return ((x = std::lcm(x, xs)), ...);
 * }
 *
 * std::gcd(int a, int b)
 *
 * cout << setprecision(n);
 *
 * set with custom ordering
 * set<ll, decltype(&cmp)> qu(cmp);
 *
 */

typedef int64_t ll;

ll bestcolfill(vector<vector<ll>>& v, bitset<4> &pre, ll n) {

    // ha egy adott sor mar el van rendezve
    // akkor dp[i] = dp[i-1]

    /*
    for(ll i = 0; i < n; i++) {
        cerr << "\n" << v[i];
    }
    */ 

    /*
    for(ll i = 0; i < n; i++) {
        for(ll j = i; j < n; j++) {

            // ha i-tol j-ig free
            // akkor azokat az ertekeket mind atallitjuk 0-ra

            bool yes = true;
            for(ll k = i; k <= j; k++) {
                if(pre[k] == false) {
                    yes = false;
                    break;
                }
            }

            if(yes == true) {
                v[i][j] = 0;
            }
        }
    }
    */

    vector<ll> dp(n, INT64_MAX / 2);
    // dp[i] = minimum koltseg hogy az i-edik sorig (inclusiv) ki legyen toltve az egesz

    for(ll i = 0; i < n; i++) {

        if(pre[i] == true) {
            if(i == 0) {
                dp[i] = 0;
            }else{
                dp[i] = dp[i-1];
            }
        }

        for(ll j = 0; j <= i; j++) {
            
            if(j > 0) {

                for(ll back = j-1; back <= i-1; back++) {
                    dp[i] = min(dp[i], dp[back] + v[j][i]);
                }

            }else{

                dp[i] = min(v[j][i], dp[i]);
            }
        }
    }

    //cerr << "\ndp=" << dp;

    return dp[n-1];

}

void solve() {

    ll n, m;
    cin >> n >> m;

    vector<ll> tp(11, 1);
    for(ll i = 1; i <= 10; i++) {
        tp[i] = 2 * tp[i-1];
    }

    ll finans = 0;

    vector<ll> row(n, 0);
    for(ll i = 0; i < n; i++) {
        cin >> row[i];
        finans += row[i];
    }

    ll gn = (n * (n+1))/2;

    vector<vector<vector<ll>>> col(m, vector<vector<ll>>(n, vector<ll>(n, 0)));

    for(ll i = 0; i < m; i++) {

        for(ll f = 0; f < n; f++) {
            for(ll s = f; s < n; s++) {

                cin >> col[i][f][s];

            }   
        }
    }

    for(ll i = 0; i < tp[n]; i++) {

        // melyik row-ok vannak elore kitoltve

        ll ansh = 0;

        bitset<4> rf(false);
        ll c = i;
        ll ci = 0;
        while(c > 0) {
            rf[ci] = (c % 2 == 1);
            
            if(rf[ci]) {
                ansh += row[ci];
            }
            
            c /= 2;
            ci++;
        }
        
        //cerr << "\nrf=" << rf;

        for(ll j = 0; j < m; j++) {
            //cerr << "\nj=" << j;
            ansh += bestcolfill(col[j], rf, n);
        }

        finans = min(finans, ansh);
    }

    cout << finans;

}

int main()
{
    std::ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    solve();

    return 0;
}