蓝桥杯之跳跃

n,m=map(int,input().split())
rec=[]
for i in range(n):
    rec.append(list(map(int,input().split())))
# print(rec)
direction = [[1,0],[1,1],[1,2],[0,1],[0,2],[0,3],[2,0],[2,1],[3,0]]
values=[]
if m==0 and n==0:
    print(rec[0][0])
    exit(0)
def fun(i,j,dire,value):
    if i+dire[0]<=n-1 and j+dire[1] <=m-1:
        if i+dire[0] == n-1 and j+dire[1]==m-1:
            values.append(value+rec[n-1][m-1])
        else:
            for l in direction:
                fun(i+dire[0],j+dire[1],l,value+rec[i+dire[0]][j+dire[1]])
                # fun(i + dire[0], j + dire[1], l, value + rec[j + dire[1]][i + dire[0]])
for l in direction:
    fun(0,0,l,rec[0][0])
print(max(values))