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.

Examples

Input

3 4
1 4
2 2 5 1
1 3 3 2
2 2 5 1


Output

11


Input

5 3
1 2 3 4
10 1 1
1 1 1
1 10 1
1 1 1
1 1 10


Output

20
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FORD(i,b,a) for (int i = (int)(b) - 1; i >= a; --i)
#define REP(i,N) FOR(i,0,N)
#define st first
#define nd second
#define pb push_back

typedef pair<int, int> PII;
typedef long long LL;

int A[6000];
int B[6000][300];

LL increase[6000];
int increase_from[6000][300];
stack<int> increasing[300];

void set_increase_from(int i, int j, int to) {
  increase[i] += to - increase_from[i][j];
  increase_from[i][j] = to;
}

int main() {
  int N, M;
  scanf("%d%d", &N, &M);
  FOR(i,1,N) scanf("%d", &A[i]);

  REP(i,N)REP(j,M) scanf("%d", &B[i][j]);

  LL result = 0;
  FORD(i,N,0) {
    REP(j,M) {
      while (!increasing[j].empty() && B[increasing[j].top()][j] <= B[i][j]) {
        set_increase_from(increasing[j].top(), j, 0);
        increasing[j].pop();
      }
      if (!increasing[j].empty()) set_increase_from(increasing[j].top(), j, B[increasing[j].top()][j] - B[i][j]);
      increasing[j].push(i);
    }

    LL sum = 0;
    REP(j,M) sum += B[i][j];
    result = max(result, sum);
    FOR(j,i+1,N) {
      sum += increase[j];
      sum -= A[j];
      result = max(result, sum);
    }
  }

  printf("%lld\n", result);
}
