백준 [ALGORITHM] - 최댓값 (2566)

lst = []
addr_x, addr_y = 0, 0 

for i in range(9):
    row = input().split()
    row = [int(num) for num in row]
    lst.append(row)

maximum = lst[0][0]
for i in range(len(lst)):
    for j in range(len(lst[i])):
        if maximum <= lst[i][j]:
            maximum = lst[i][j]
            addr_x = i
            addr_y = j

print(maximum)
print(addr_x+1 , addr_y+1)