Максимум двумерного списка

n,m = map(int,input().split())
maks = -10**9
a = [0,0]
for i in range(n):
    row = input().split()
    for j in range(m):
        row[j] = int(row[j])
        if row[j] > maks:
            maks = row[j]
            a.clear()
            a.insert(0,i)
            a.insert(1,j)
print(*a)

n, m = map(int, input().split())
data = [[int(i) for i in input().split()] for _ in range(n)]
temp = [max(line) for line in data]
row = temp.index(max(temp))
col = data[row].index(max(data[row]))
print(row, col)

n, m = map(int, input().split())
data = [[int(i) for i in input().split()] for _ in range(n)]
temp = sum(data, [])
index = temp.index(max(temp))
print(*divmod(index, m))

n, m = map(int, input().split())
data = [int(i) for i in input().split()]
current_max = max(data)
row, col = 0, data.index(current_max)
for line in range(1, n):
    data = [int(i) for i in input().split()]
    line_max = max(data)
    if line_max > current_max:
        current_max = line_max
        row, col = line, data.index(line_max)
print(row, col)

n, m = map(int, input().split())
data = [[int(i) for i in input().split()] for _ in range(n)]
line = max(data, key=max)
print(data.index(line), line.index(max(line)))