#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
template<typename T>
struct Segment_Tree {
	typedef function<T(T, T)> F;

	ll n;
	F f;//モノイドとしての演算(最小値、和　など)
	T unit;//単位元

	ll size;
	vector<T> seg;

	Segment_Tree(ll n0, F f0, T unit0) {
		n = n0;
		f = f0;
		unit = unit0;

		size = 1;
		while (size < n) {
			size *= 2;
		}
		seg.assign(2 * size, unit);
	}


	void update(ll k, T x) {//k番目の要素をxに更新
		k += size - 1;
		seg[k] = x;
		while (k > 1) {
			k /= 2;
			seg[k] = f(seg[2 * k], seg[2 * k + 1]);
		}
	}



	T query_prep(ll a, ll b, ll k, ll l, ll r) {//[a,b)とkに対応する区間[l,r)の共通部分でクエリ
		if (b <= l || a >= r) { return unit; }
		if (a <= l && r <= b) { return seg[k]; }

		T v1 = query_prep(a, b, 2 * k, l, (l + r) / 2);
		T v2 = query_prep(a, b, 2 * k + 1, (l + r) / 2, r);
		return f(v1, v2);

	}

	T query(ll a, ll b) {
		return query_prep(a, b, 1, 1, size + 1);
	}

};

ll N, M;

ll hap(ll l, ll r, vector<ll>& dis, Segment_Tree<vector<ll>>& seg) {
	//cout << l << " " << r << endl;

	ll ret = 0;

	vll c = seg.query(l, r + 1);

	repn(j, M)ret += c[j];

	//repn(j, M)cout << c[j] << " ";
	//cout << endl;

	ret -= dis[r];
	ret += dis[l];

	//cout << ret << endl;
	return ret;
}

int main() {
	cin >> N >> M;

	auto f = [](vll a, vll b) {
		vll ret(M + 1);
		repn(i, M)ret[i] = max(a[i], b[i]);
		return ret;
	};
	vll unit(M + 1, 0);
	
	Segment_Tree<vector<ll>> seg(N, f, unit);
	
	

	
	vector<ll> A(N);
	repn(i, N - 1)cin >> A[i];
	repn(i, N) {
		vll b(M + 1);
		repn(j, M) cin >> b[j];
		seg.update(i, b);
	}

	
	vll dis(N + 1, 0);
	repn(i, N - 1)dis[i + 1] = dis[i] + A[i];

	vll mx(N + 1);

	vector<pair<ll, ll>> p(N + 1);
	repn(i, N) {
		ll x = i;
		ll c = 0;
		while (x % 2 != 0) { x /= 2; c++; }
		p[i] = { c,i };
	}

	sort(++p.begin(), p.end(), greater <pair<ll, ll>>());
	set<ll> st;
	
	
	repn(i, N) {
		ll x = p[i].second;
		auto itr = st.upper_bound(x);
		ll s, t;

		if (itr == st.end()) { t = N; }
		else { t = mx[*itr]; }

		if (itr == st.begin()) { s = x; }
		else { s = max(x, mx[*(--itr)]); }

		ll mxval = hap(x, s, dis, seg);
		ll mxind = s;
		for (ll j = s + 1; j <= t; j++) {
			ll now = hap(x, j, dis, seg);
			if (now > mxval) { mxind = j; mxval = now; }
		}

		mx[x] = mxind;
		st.insert(x);
		
	}
	

	ll ans = -INF;

	repn(i, N) {
	//	cout << i << " " << mx[i] << endl;
		ans = max(ans, hap(i, mx[i], dis, seg));
	}
	cout << ans << endl;
	
	

}

Measured memory_bytes: 30096