antilex

def antilex(a):
    pp = False
    n = len(a) - 1
    while True:
        e = n
        pos = -1
        print(a)
        for i in range(n):
            if a[i] < a[i + 1]:
                pos = i
                pp = True
        if pp == True:
            while a[pos] >= a[e]:
                e -= 1
            a[pos], a[e] = a[e], a[pos]
            j = pos + 1
            k = n
            while j <= k:
                a[j], a[k] = a[k], a[j]
                k -= 1
                j += 1
        else: break
        pp = False