#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)));

    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 minimum = LLONG_MAX;

    for(int mask = 0; mask < (1 << sor); mask++)
    {
        long long eredmeny = 0;
        long long sorosszeg = 0;
        
        vector<bool> b(sor + 1);

        for(int m = 0; m < sor; m++)
        {
            if(((mask >> m) & 1))
            {
                sorosszeg += r[m + 1];
                b[m + 1] = 1;
            }
        }

        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++)
                    {
                        if(b[s])
                        {
                            dp[s] = min(dp[s], min(dp[s - k] + c[o][j][s], dp[s - 1]));
                        }else
                        {
                            dp[s] = min(dp[s], dp[s - k] + c[o][j][s]);
                        }
                    }
                }
            }

            eredmeny += dp[sor];
        }

        minimum = min(minimum, eredmeny + sorosszeg);
    }

    cout << minimum;

    return 0;
}