/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;

constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// Segment Tree for query sum[a, b)
template<typename T>
class SegTree {
    using F = function<T(T, T)>;
    int N;
    vector<T> dat;
    const F f;  // merge monoids
    const T ID; // identity

    // RangeSumQuery:
    // auto f = [](ll a, ll b) { return a+b; };
    // auto ID = 0LL;

    // RangeMaximumQuery:
    // auto f = [](ll a, ll b) { return max(a, b); };
    // auto ID = 0LL;
    // (sometimes it should be LLONG_MIN)

    // RangeMinimumQuery:
    // auto f = [](ll a, ll b) { return min(a, b); };
    // auto ID = LLONG_MAX;

    // auto seg = SegTree<ll>(100000, f, ID);
public: SegTree(int n, const F f, const T& ID) : f(f), ID(ID) {
    N = 1;
    while(N < n) N *= 2;
    dat.resize(2*N-1, ID);
  }

public: void build(vector<T>& a) {
    int n = a.size();
    for(int i=0; i<n; i++) dat[i+N-1] = a[i];
    for(int i=N-2; i>=0; i--) dat[i] = f(dat[i*2+1], dat[i*2+2]);
  }

  // update k-th element
public: void update(int k, const T& a) {
    k += N-1;
    dat[k] = a;
    while(k > 0) {
      k = (k-1)/2;
      dat[k] = f(dat[k*2+1], dat[k*2+2]);
    }
  }

  // add k-th element by a
public: void add(int k, const T& a) {
    k += N-1;
    dat[k] = f(dat[k], a);
    while(k > 0) {
      k = (k-1)/2;
      dat[k] = f(dat[k*2+1], dat[k*2+2]);
    }
  }

  // return sum[a, b)
public: T query(int a, int b) {
    return query(a, b, 0, 0, N);
  }
public: T query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return ID;
    if (a <= l && r <= b) return dat[k];
    auto m = (l+r)/2;
    return f(query(a, b, k*2+1, l, m), query(a, b, k*2+2, m, r));
  }
};

class FYakinikuRestaurants {
public:

    void func(int l, int r, SegTree<P>& seg, vector<vector<ll>>& dp) {
      if (l >= r) return;
      auto p = seg.query(l, r);
      auto val = p.first;
      auto pos = p.second;
      dp[l][pos] += val;
      dp[l][r] -= val;
      dp[pos+1][pos] -= val;
      dp[pos+1][r] += val;
      func(l, pos, seg, dp);
      func(pos+1, r, seg, dp);
    }

    void solve(istream& cin, ostream& cout) {
      SPEED;
      int n, m; cin >> n >> m;
      vector<ll> a(n);
      for(int i=0; i<n-1; i++) {
        ll d; cin >> d;
        a[i+1] = a[i] + d;
      }

      vector<vector<ll>> dp(n+1, vector<ll>(n+1));

      auto f = [](P a, P b) { return ((a.first >= b.first) ? a : b); };
      auto seg = SegTree<P>(n, f, {0, 0});

      vector<vector<ll>> b(n, vector<ll>(m));
      rep(i, n) {
        rep(j, m) {
          cin >> b[i][j];
        }
      }


      rep(j, m) {
        rep(i, n) {
          seg.update(i, {b[i][j], i});
        }
        func(0, n, seg, dp);
      }

      for(int i=0; i<=n; i++) {
        for(int j=0; j<n; j++) {
          dp[i][j+1] += dp[i][j];
        }
      }

      for(int j=0; j<=n; j++) {
        for(int i=0; i<n; i++) {
          dp[i+1][j] += dp[i][j];
        }
      }

      ll ret = 0;
      for(int i=0; i<n; i++) {
        for(int j=i; j<n; j++) {
          ll d = a[j] - a[i];
          chmax(ret, dp[i][j]-d);
        }
      }
      cout << ret << endl;
    }
};

signed main() {
  FYakinikuRestaurants solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}

Measured memory_bytes: 207032