#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int ar[100001][5][5];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<int>sorar(n);
    for (int i = 0; i < n; i++)
    {
        int x; cin >> x;
        sorar[i] = x;
    }
    for (int i = 1; i <= m; i++)
    {
        for (int y = 1; y <= n; y++)
        {
            for (int z = y; z <= n; z++)
            {
                int x; cin >> x;
                ar[i][y][z] = x;
            }
        }
    }
    long long best_sum = 1e18;
    for (int bitmask = 0; bitmask <= (1 << n)-1; bitmask++)
    {
        long long sum = 0;
        for (int j = 0; j <= n - 1; j++)
        {
            if ((bitmask & (1 << j)) != 0)
                sum += sorar[j];
        }
        for (int i = 1; i <= m; i++)
        {
            vector<long long>dp(n + 1, 1e18);
            dp[0] = 0;
            for (int y = 1; y <= n; y++)
            {
                if ((bitmask & (1 << (y - 1))) != 0)
                    dp[y] = dp[y-1];
                for (int z = 1; z <= n; z++)
                {
                    for (int q = z; q <= n; q++)
                    {
                        if(y>=z and y<=q)
                            dp[y] = min(dp[y], ar[i][z][q] + dp[z - 1]);
                     }
                 }
                
            }
            sum += dp[n];
        }
        best_sum = min(best_sum, sum);
    }
    cout << best_sum;
}