Working out （DP）

Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and mcolumns. Let number a[i][j] represents the calories burned by performing workout at the cell of gym in the i-th line and the j-th column.

Iahub starts with workout located at line 1 and column 1. He needs to finish with workout a[n][m]. After finishing workout a[i][j], he can go to workout a[i + 1][j] or a[i][j + 1]. Similarly, Iahubina starts with workout a[n][1] and she needs to finish with workout a[1][m]. After finishing workout from cell a[i][j], she goes to either a[i][j + 1] or a[i - 1][j].

There is one additional condition for their training. They have to meet in exactly one cell of gym. At that cell, none of them will work out. They will talk about fast exponentiation (pretty odd small talk) and then both of them will move to the next workout.

If a workout was done by either Iahub or Iahubina, it counts as total gain. Please plan a workout for Iahub and Iahubina such as total gain to be as big as possible. Note, that Iahub and Iahubina can perform workouts with different speed, so the number of cells that they use to reach meet cell may differs.

Input

The first line of the input contains two integers n and m (3 ≤ n, m ≤ 1000). Each of the next n lines contains m integers: j-th number from i-th line denotes element a[i][j] (0 ≤ a[i][j] ≤ 10⁵).

Output

The output contains a single number — the maximum total gain possible.

Examples

Input

3 3
100 100 100
100 1 100
100 100 100

Output

800

Note

Iahub will choose exercises a[1][1] → a[1][2] → a[2][2] → a[3][2] → a[3][3]. Iahubina will choose exercises a[3][1] → a[2][1] → a[2][2] → a[2][3] → a[1][3].

题目大意：

输入n,m，然后输入n*m的矩阵，一个人从左上角到右下角，另一个人从左下角到右下角，两个人有且仅有一个地方相遇，求最大所有经过的地方的权值和（不包括相遇地）。

#include <bits/stdc++.h>
using namespace std;
int dp1[1005][1005],dp2[1005][1005],dp3[1005][1005],dp4[1005][1005];
int n,m,a[1005][1005];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)///(1,1)到(i,j)的最大值
        for(int j=1;j<=m;j++)
            dp1[i][j]=max(dp1[i-1][j],dp1[i][j-1])+a[i][j];
    for(int i=n;i>0;i--)///(n,m)到(i,j)的最大值
        for(int j=m;j>0;j--)
            dp2[i][j]=max(dp2[i+1][j],dp2[i][j+1])+a[i][j];
    for(int i=1;i<=n;i++)///(1,m)到(i,j)的最大值
        for(int j=m;j>0;j--)
            dp3[i][j]=max(dp3[i-1][j],dp3[i][j+1])+a[i][j];
    for(int i=n;i>0;i--)///(n,1)到(i,j)的最大值
        for(int j=1;j<=m;j++)
            dp4[i][j]=max(dp4[i+1][j],dp4[i][j-1])+a[i][j];
    int ans=0;
    for(int i=2;i<n;i++)///枚举相遇点即可
        for(int j=2;j<m;j++)
        {
            ans=max(ans,dp1[i-1][j]+dp2[i+1][j]+dp3[i][j+1]+dp4[i][j-1]);
            ans=max(ans,dp1[i][j-1]+dp2[i][j+1]+dp3[i-1][j]+dp4[i+1][j]);
        }
    cout<<ans<<'
';
    return 0;
}