Luis Alejandro Forigua Rojas 20171020115

Ciencias de la computación 1

Candy

if __name__ == '__main__':
m, n = 1,1
#arr.append([int(0) for x in range(n+1)])
m, n = map(int, input().split())
while n != 0 or m != 0:
if(m==0 and n == 0): break
arr = []
for i in range(m):
arr.append(list(map(int, input().split())))
#print(arr[i])
auxf1=0
auxf2=0
auxf3=0
#for i in range(1,m+1,1):
for i in range(m):
#arr[i].insert(0,0)
#arr[i].insert(n,0)
aux1 = 0
aux2 = 0
aux3 = 0
#for j in range(1,n+1,1):
for j in range(n):
#aux1 = arr[i][j-1]
aux3 = aux1
#print(arr[i][j],end="")
aux1 = max(aux1,arr[i][j]+aux2)
aux2 = aux3

#print(arr[i])
#auxf1=arr[i-1][n]
auxf3 = auxf1
#arr[i][n] = max(auxf1, arr[i][n]+auxf2)
auxf1 = max(auxf1,aux1+auxf2)
auxf2 = auxf3
print(auxf1)
m, n = map(int, input().split())