import random # matrixsortp.py
n=3; m=5; a=[1,1]; b=[1,1]
a=[[random.randrange(0,9) for i in range (m)] for j in range (n)]
b=[[1 for i in range (m)] for j in range (n)]

for i in range (n):
    for j in range (m):
        print ("%2d" % a[i][j], end=' ')
        b[i][j]=a[i][j]
    print()
print()

for i in range (n):
    for j in range (m-1):
        for k in range (j+1,m):
           if (a[i][j]>a[i][k]):
               t=a[i][j]; a[i][j]=a[i][k]; a[i][k]=t;

for i in range (n):
    for j in range (m):
        print ("%2d" % a[i][j], end=' ')
    print()
print()

for i in range (n):
    for j in range (m):
        print ("%2d" % b[i][j], end=' ')
    print()
print()

for j in range (m):
    for i in range (n-1):
        for k in range (i+1,n):
            if (b[i][j]>b[k][j]):
               t=b[i][j]; b[i][j]=b[k][j]; b[k][j]=t;

for i in range (n):
    for j in range (m):
        print ("%2d" % b[i][j], end=' ')
    print()
