#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const ll inf = 1e18;

template<class T>struct SegTree{
	T *dat, *lazy;
	int n;
	SegTree(int size = 1000000){
		for(n = 1; n < size; n *= 2);
		dat = new T[2 * n - 1];
		lazy= new T[2 * n - 1];
		init();
	}
	~SegTree(){ delete [] dat; delete [] lazy; }
	
	void init(){
		rep(i, 2 * n - 1) dat[i] = 0;
		rep(i, 2 * n - 1) lazy[i]= 0;
	}
	void add(int a, int b, ll v, int k, int l, int r){
		if(r <= a || b <= l) return;
		if(a <= l && r <= b){ lazy[k] += v; return; }
		if(lazy[k]){
			lazy[k * 2 + 1] += lazy[k];
			lazy[k * 2 + 2] += lazy[k]; lazy[k] = 0;
		}
		add(a, b, v, k * 2 + 1, l, (l + r) / 2);
		add(a, b, v, k * 2 + 2, (l + r) / 2, r);
		dat[k] = max(dat[k * 2 + 1] + lazy[k * 2 + 1], dat[k * 2 + 2] + lazy[k * 2 + 2]);
	}
	T query(int a, int b, int k, int l, int r){
		if(r <= a || b <= l) return -inf;
		if(a <= l && r <= b) return dat[k] + lazy[k];
		if(lazy[k]){
			lazy[k * 2 + 1] += lazy[k];
			lazy[k * 2 + 2] += lazy[k]; lazy[k] = 0;
		}
		T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
		T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
		dat[k] = max(dat[k * 2 + 1] + lazy[k * 2 + 1], dat[k * 2 + 2] + lazy[k * 2 + 2]);
		return max(vl, vr);
	}
	T query(int a, int b){ return query(a, b, 0, 0, n); }
	void add(int a, int b, ll v){ add(a, b, v, 0, 0, n); }
};

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int n, m; cin >> n >> m;
	vector<ll> a(n);
	vector<vi> b(n, vi(m));
	rep(i, n - 1) cin >> a[i];
	rep(i, n) rep(j, m) cin >> b[i][j];
	
	ll ans = 0;
	vector<deque<int>> qs(m);
	SegTree<ll> seg(n);
	for(int i = n - 1; i >= 0; i--){
		rep(j, m){
			deque<int> &q = qs[j];
			while(q.size() && b[q[0]][j] < b[i][j]){
				seg.add(q[0], q.size() < 2 ? n : q[1], -b[q[0]][j]);
				q.pop_front();
			}
			seg.add(i, q.size() ? q[0] : n, b[i][j]);
			q.push_front(i);
		}
		//dbg(i); for(int j = i; j < n; j++) dbg(j, seg.query(j, j + 1));
		
		ans = max(ans, seg.query(i, n));
		if(i) seg.add(i, n, -a[i - 1]);
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 6400