There are N barbecue restaurants along a street.
The restaurants are numbered 1 through N from west to east, and the distance between restaurant i and restaurant i+1 is A_i.
Joisino has M tickets, numbered 1 through M.
Every barbecue restaurant offers barbecue meals in exchange for these tickets.
Restaurant i offers a meal of deliciousness B_{i,j} in exchange for ticket j.
Each ticket can only be used once, but any number of tickets can be used at a restaurant.
Joisino wants to have M barbecue meals by starting from a restaurant of her choice, then repeatedly traveling to another barbecue restaurant and using unused tickets at the restaurant at her current location.
Her eventual happiness is calculated by the following formula: "(The total deliciousness of the meals eaten) - (The total distance traveled)".
Find her maximum possible eventual happiness.

-----Constraints-----
 - All input values are integers.
 - 2≤N≤5×10^3
 - 1≤M≤200
 - 1≤A_i≤10^9
 - 1≤B_{i,j}≤10^9

-----Input-----
The input is given from Standard Input in the following format:
N M
A_1 A_2 ... A_{N-1}
B_{1,1} B_{1,2} ... B_{1,M}
B_{2,1} B_{2,2} ... B_{2,M}
:
B_{N,1} B_{N,2} ... B_{N,M}

-----Output-----
Print Joisino's maximum possible eventual happiness.

-----Sample Input-----
3 4
1 4
2 2 5 1
1 3 3 2
2 2 5 1

-----Sample Output-----
11

The eventual happiness can be maximized by the following strategy: start from restaurant 1 and use tickets 1 and 3, then move to restaurant 2 and use tickets 2 and 4.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "def main():\n    import sys\n    from array import array\n    input = sys.stdin.readline\n\n    class Bit:\n        def __init__(self, n):\n            self.size = n\n            self.size_bit_length = n.bit_length()\n            self.tree = array('h', [0] * (n+1))\n\n        def reset(self):\n            self.tree = array('h', [0] * (self.size+1))\n\n        def sum(self, i):\n            s = 0\n            while i > 0:\n                s += self.tree[i]\n                i -= i & -i\n            return s\n\n        def add(self, i, x):\n            while i <= self.size:\n                self.tree[i] += x\n                i += i & -i\n\n        def lower_bound(self, w):\n            if w <= 0:\n                return 0\n            x = 0\n            k = 1 << (self.size_bit_length - 1)\n            while k:\n                if x + k <= self.size and self.tree[x + k] < w:\n                    w -= self.tree[x + k]\n                    x += k\n                k >>= 1\n            return x + 1\n\n    N, M = list(map(int, input().split()))\n    dist = [0] + list(map(int, input().split()))\n    for i in range(N-1):\n        dist[i+1] += dist[i]\n    B = [0] * (M * N)\n    for i in range(N):\n        BB = list(map(int, input().split()))\n        for j in range(M):\n            B[j * N + i] = BB[j] * (N+1) + i+1\n\n    imos = []\n    for i in range(N+1):\n        imos.append([0] * (N+1 - i))\n    bit = Bit(N)\n    for m in range(M):\n        bit.reset()\n        for bi in sorted(B[m*N: (m+1) * N], reverse=True):\n            b, i = divmod(bi, N+1)\n            k = bit.sum(i)\n            l = bit.lower_bound(k)\n            r = bit.lower_bound(k+1)\n            imos[l+1][i - (l+1)] += b\n            if i != N:\n                imos[i+1][0] -= b\n            if r != N+1:\n                imos[l+1][r - (l+1)] -= b\n            if i != N and r != N+1:\n                imos[i+1][r - (i+1)] += b\n            bit.add(i, 1)\n\n    for i in range(1, N+1):\n        for j in range(i+1, N+1):\n            imos[i][j - i] += imos[i][j-1-i]\n    for i in range(2, N + 1):\n        for j in range(i, N + 1):\n            imos[i][j-i] += imos[i - 1][j - (i-1)]\n    ans = 0\n    for i in range(1, N + 1):\n        for j in range(i, N + 1):\n            ans = max(ans, imos[i][j-i] - (dist[j - 1] - dist[i - 1]))\n    print(ans)\n\n\ndef __starting_point():\n    main()\n\n__starting_point()"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 19251