#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

template <class T> ostream& operator <<(ostream & os, const vector<T> &vec)
{
	for (int i = 0; i < vec.size() - 1; ++i) os << vec[i] << ' ';
	return os << vec[vec.size() - 1];
}

template <class T1, class T2> ostream& operator <<(ostream & os, const pair<T1, T2> &p)
{
	return os << p.X << " " << p.Y;
}

template <typename T>
void pr(T var1)
{
	cout << var1 << '\n';
}
template <typename T, typename... Types>
void pr(T var1, Types... var2)
{
	cout << var1;
	pr(var2...);
}

void in(int &n, VI &a) //array of ints
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VS &a) //array of strings
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VPII &a) //array of pairs
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i].X >> a[i].Y;
}

void in(int &n, int &m, VVI &g) //unweighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, VVI &g) //unweighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, int &m, vector <VPII> &g) //weighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

void in(int &n, vector <VPII> &g) //weighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

const LL INF = 1e+16;

int n, m;
VI row;
vector < VLL > col;

void go(int c, int msk)
{
	LL ans = col[c][msk];
	FOR(msk2, 1, (1 << n) - 1)
	{
		if (msk2 == msk) continue;
		if ((msk & msk2) != msk2) continue;
		go(c, msk ^ msk2);
		ans = min(ans, col[c][msk2] + col[c][msk ^ msk2]);
	}
	col[c][msk] = ans;
}

int main()
{
	#ifdef AT_HOME
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#endif

	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

	cin >> n >> m;
	row.RS(n + 1);
	FOR(i, 1, n) cin >> row[i];
	int PAIRS = n * (n + 1) / 2;
	col.RS(m + 1, VLL(1 << n, INF));
	FOR(i, 1, m)
	{
		int l = 1, r = 1;
		FOR(j, 1, PAIRS)
		{
			int x;
			cin >> x;
			int msk = 0;
			FOR(k, l, r) msk |= 1 << (k - 1);
			col[i][msk] = x;
			++r;
			if (r == n + 1) ++l, r = l;
		}
	}

	FOR(i, 1, m) 
	{
		FOR(msk, 0, (1 << n) - 1)
			for (int msk2 = msk; msk2; msk2 = msk & (msk2 - 1))
				col[i][msk2] = min(col[i][msk2], col[i][msk]);
		go(i, (1 << n) - 1);
		FOR(msk, 0, (1 << n) - 1)
			for (int msk2 = msk; msk2; msk2 = msk & (msk2 - 1))
				col[i][msk2] = min(col[i][msk2], col[i][msk]);

	}

	LL sol = INF;
	FOR(rowMask, 0, (1 << n) - 1)
	{
		LL sum = 0;
		int msk = 0;
		FOR(i, 1, n)
			if (rowMask & (1 << (i - 1))) sum += row[i];
		else msk |= 1 << (i - 1);

		FOR(i, 1, m)
		{
			sum += col[i][msk];
		}
		sol = min(sol, sum);
	}
	pr(sol);

	return 0;
}