#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int main()
{
    int sor, oszlop;
    cin >> sor >> oszlop;

    vector<long long> r(sor + 1);
    for(int i = 1; i <= sor; i++)
    {
        cin >> r[i];
    }

    vector<vector<vector<long long>>> c(oszlop + 1, vector<vector<long long>>(sor + 1, vector<long long>(sor + 1))); // j, l, r

    for(int j = 1; j <= oszlop; j++)
    {
        for(int l = 1; l <= sor; l++)
        {
            for(int r2 = l; r2 <= sor; r2++)
            {
                long long ertek;
                cin >> ertek;

                c[j][l][r2] = ertek;
            }
        }
    }

    long long eredmeny = LLONG_MAX;

    for(int mask = 0; mask < (1 << sor); mask++)
    {
        long long minimum = 0;

        for(int o = 1; o <= oszlop; o++)
        {
            vector<long long> dp(sor + 1, LLONG_MAX);
            dp[0] = 0;

            for(int s = 1; s <= sor; s++)
            {
                for(int k = 1; k <= s; k++)
                {
                    for(int j = 1; j <= s - k + 1; j++)
                    {
                        dp[s] = min(dp[s], dp[s - k] + c[o][j][s]);
                    }
                }

                if(((mask >> (s - 1)) & 1))
                {
                    dp[s] = min(dp[s], dp[s - 1] + r[s]);
                }
            }

            minimum += dp[sor];
        }
        eredmeny = min(eredmeny, minimum);
    }

    cout << eredmeny;

    return 0;
}