/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>

using namespace std;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#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 FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(int a, int b){
	return (ll)a * (ll)b % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

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

inline double ccw(pii A, pii B, pii C){
	return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}

inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 5e3 + 10;
const int M = 205;
const int LOG = 14;

ll n, m, a[N], b[N][M], dp[N], best[M], c[N][N];

namespace rmq{
	ll naj_pot[N], t[LOG][M][N];

	void init(){
		naj_pot[1] = 0;
		FOR(i, 2, n + 1)
			naj_pot[i] = naj_pot[i / 2] + 1;

		REP(k, m)
			REP(i, n)
				t[0][k][i] = b[i][k];

		REP(k, m){
			for (int pot = 0; (1 << pot) <= n; ++pot){
				REP(i, n){
					t[pot + 1][k][i] = max(t[pot][k][i], 
						(i + (1 << pot) < n ? t[pot][k][i + (1 << pot)] : -INF));
					//cout << pot _ k _ i _ t[pot][k][i] << '\n';
				}
			}
		}
	}

	ll query(int l, int r){
		ll pot = naj_pot[r - l];
		ll ret = 0;
		REP(i, m){
			ret += max(t[pot][i][l], t[pot][i][r - (1 << pot)]);
			//cout << l _ r _ i _ max(t[pot][i][l], t[pot][i][r - (1 << pot)]) << '\n';
		}
		return ret;
	}

}

void izracunaj(int lo, int hi, int optL, int optR){
	if (lo > hi)
		return;
	int mid = (lo + hi) / 2;
	int opt = -1;
	dp[mid] = -INFL;

	for (int i = optL; i <= min(mid, optR); ++i){
		if (rmq::query(i, mid + 1) - c[i][mid] > dp[mid]){
			dp[mid] = rmq::query(i, mid + 1) - c[i][mid];
			opt = i;
		}
	}

	izracunaj(lo, mid - 1, optL, opt);
	izracunaj(mid + 1, hi, opt, optR);
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> m;
	REP(i, n - 1)
		cin >> a[i];

	REP(i, n)
		REP(j, m)
			cin >> b[i][j];

	rmq::init();
	//cout << '\n';

	REP(i, n){
		ll dist = 0;
		FOR(j, i, n){
			c[i][j] = dist;
			dist += a[j];
		}
	}

	// REP(i, n)
	// 	FOR(j, i, n)
	// 		cout << i _ j _ rmq::query(i, j + 1) << '\n';

	izracunaj(0, n - 1, 0, n - 1);

	ll sol = 0;
	REP(i, n)
		sol = max(sol, dp[i]);

	cout << sol << '\n';
	
	return 0;
}


Measured memory_bytes: 238076