Метод Перестановки

import itertools
 
N=int(input())
i=1
A=[i for i in range(1, N+1)]
A=''.join(str(x) for x in A)
print(A)
for i in itertools.permutations(A, N):
    print(' '.join(i))

from itertools import permutations
 
a = permutations(range(20), 3)
print(*(next(a) for i in range(5)))

import itertools
 
N, K = map(int, input().split())
 
A = [i for i in range(1, N + 1)]
A = ''.join(str(x) for x in A)
print(A)
for i, el in enumerate(itertools.permutations(A, N), 1):
    if i == K:
        print(' '.join(el))
        break

from itertools import accumulate
from operator import mul
 
n = int(input())
k = int(input()) - 1
*f, = accumulate(range(1, n), func=mul, initial=1)
res = []
*p, = range(n)
for i in f[::-1]:
    j, k = divmod(k, i)
    res.append(p[j])
    p.remove(p[j])
print(*(x + 1 for x in res))

import math
 
def get_perm_with_counter(n, counter):
    res = list()
    perm_lis_cur = [*range(1, n + 1)]
    n_cur = n
    k_cur = counter - 1
 
    while perm_lis_cur:
        ind_cur, k_cur = divmod(k_cur, math.factorial(n_cur - 1))
        if ind_cur >= len( perm_lis_cur ):
            break
        dig_cur = perm_lis_cur.pop(ind_cur)
        res.append(dig_cur)
        n_cur -= 1
    return res