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

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))
huge = 0
number = []
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=" ")
    add.append(huge)
    number.append(i+1)
    print()
insertion_sort(add,number)
for i in range(n):
    print(f"{i+1} Место команда под номером {number[i]} , c общим счётом : {add[i]}")