n, m = map(int, input().split())
v = []
for i in range(n):
    v.append([])

sumi = []
for i in range(n):
    sumi.append([])
    sumi[i] = [0]*m
maxx = 0
okey = 0
for i in range(n):
    for j in input().split():
        j = int(j)
        v[i].append(j)




def find_max(i, j):
    global okey
    #global valu
    if sumi[i][j] == maxx:
        okey = 1

    if okey == 0:
        if i > 0:
            find_max(i-1, j)
        if j < n-1:
            find_max(i, j+1)
    if okey == 1:
        print(i+1, ' ', j+1)



ind1, ind2 = 0, 0
forw = [9999]*max(m, n)*15


def chess(i, j, suma):
    global ind1, ind2
    global maxx
    global forw
    if sumi[i][j] < suma+v[i][j]:
        sumi[i][j] = suma+v[i][j]
    if i > 0:
        forw[10*(i-1)+j] = 10*i+j
        chess(i-1, j, sumi[i][j])
    if j < n-1:
        forw[10*i+j+1] = 10*i+j
        chess(i, j+1, sumi[i][j])
    if sumi[i][j] > maxx:
        maxx = sumi[i][j]
        ind1, ind2 = i, j


chess(n-1, 0, 0)
print(maxx)
find_max(n-1, 0)
# k=10*ind1+ind2
# while k!=9999:
#print(int(k/10)+1,' ',k%10+1)
# k=forw[k]