def insertion_sort(ar):

for i in range(1, len(ar)):

    for j in range(i):
        if (ar[i]<ar[j]):
            k = ar[i]
            ar[i] = ar[j]
            ar[j] = k
    print(*ar)