file = open('name.txt', encoding = 'utf-8') s = file.read() file.close() counter = [0] * 1200 alf = 'ячсмитьбюэждлорпавыфйцукенгшщзхъё' # используем список счетчиков. создаем список повторов каждой буквы в нижнем регистре for i in range(len(s)): if s[i-1].lower() == 'т' and s[i].lower() in alf: counter[ord(s[i].lower())] += 1 m = max(counter) for i in range(1200): if counter[i] == m: print(chr(i)) break

n,m = map(int,input().split())
A = []
Q = ''
for i in range(n):
    A.append(list(map(int,input().split())))
A1 = []
for i in range(n):
    A1.append([])
    for j in range(m):
        A1[i].append(0)
A1[0][m-1] = A[0][m-1]
for i in range (1,n):
    A1[i][m-1] = A[i][m-1] + A1[i - 1][m-1]
for i in range(m-2,-1,-1):
    A1[0][i] = A[0][i] + A1[0][i + 1]
for i in range(1,n):
    for j in range (m-2,-1,-1):
        A1[i][j] = max(A1[i-1][j],A1[i][j + 1]) + A[i][j]
print(A1[n-1][0])

n,m = map(int,input().split())
A = []
for i in range (n):
    A.append([])
    for j in range(m):
        A[i].append(0)
A[n-1][0] = 1
A[n-3][1] = 1
A[n-2][2] = 1
for i in range(n-1,-1,-1):
    for j in range(m):
        if i < n - 2  and j > 1:
            A[i][j] = A[i+1][j-2]+A[i+2][j-1]
sum = 0
for i in range(n):
    sum += A[i][m-1]
print(sum)
for i in range(n):
    print(A[i])