how many possibilities of arrangement in python code.

def first():
    print('hello')
def poss(m):
    k=0    for j in range(len(m)):
        for i in range(len(m)-1):
            k+=1            x=m[i]
            m[i]=m[i+1]
            m[i+1]=x
            print(k,">",m)
            i+=1        j+=1

###input

m=[1,2,3,5]
poss(m)

##result


1 > [2, 1, 3, 5]
2 > [2, 3, 1, 5]
3 > [2, 3, 5, 1]
4 > [3, 2, 5, 1]
5 > [3, 5, 2, 1]
6 > [3, 5, 1, 2]
7 > [5, 3, 1, 2]
8 > [5, 1, 3, 2]
9 > [5, 1, 2, 3]
10 > [1, 5, 2, 3]
11 > [1, 2, 5, 3]
12 > [1, 2, 3, 5]