import random
def insertion_sort(n):
    for i in range(1, len(n)):
        key = n[i]
        j = i-1
        while j >=0 and key > n[j] :
            n[j+1] = n[j]
            j -= 1
        n[j+1] = key

n = int(input("Введите количество команд: "))
m = int(input("Введите количество участников: "))
TDarrays = []
add = []
for i in range(n):
    TDarrays.append([])
    for j in range(m):
        TDarrays[i].append(random.randint(1,10))
x = 0
huge = 0
for i in range(len(TDarrays)):
    print(f"{i+1}.", end=" ")
    huge = 0
    for g,j in enumerate(TDarrays[i]):
        huge += j
        print(TDarrays[i][g], end=" ")
    if  huge > x :
        x = huge
    add.append([])
    add[i].append(huge)
    print()
number = add
insertion_sort(add)
print(add)
for i in range(len(add)):
    for q,w in enumerate(number):
        if w == add[i]:
            print(f"{i+1} Место . Команда под номером {q+1} , c общим счётом: {add[i]} ")