arr = [1,2,3,4]
def nextPermutation(list_a):
k = -1
m = -1
for i in range(len(list_a)-1):
if list_a[i] < list_a[i+1]:
k = i
if k == -1:
return [-1]
for j in range(k,len(list_a)):
if arr[k] < arr[j]:
m = j
arr[k],arr[m] = arr[m],arr[k]
list_a = list_a[:k+1] + sorted(list_a[k+1:])
return list_a
print(nextPermutation(arr))