Неслучайное перемешивание списка по ключу

from  random import randint
h = randint(0, 100)
g = [h,[randint(i,i+100) for i in range(100)]]
print(g)

from more_itertools import nth_permutation
print( nth_permutation([1,2,3], 3, index=5) )
# (3, 2, 1)

from math import factorial
 
def primes(k) :
    res = [2]
    d = 3
    while len(res) < k:
        for e in res:
            if d%e == 0:
                d += 1
                break
        else:
            res.append(d)
    return res
 
 
n = 100
pr = primes(n)
 
f1 = factorial(n)
key = 10**200 % f1
j = n
while f1 > key:
    f1 //= j 
    j -= 1
 
m = n-j-1
res = []
ind = list(range(m, n))
 
while key > 0:
    a, key = divmod(key, f1)
    res.append(ind.pop(a))
    f1 //= j 
    j -= 1
 
result = [pr[i] for i in list(range(m)) + res + ind]
print(result)

key = 5

from itertools import permutations
from typing import NoReturn
 
 
class Combination:
 
    def __init__(self, data: list) -> None:
        self.p = permutations(data)
        self.checked = {}
 
    def get_combination(self, key: int) -> list | NoReturn:
        if key not in self.checked:
            try:
                self.checked[key] = list(next(self.p))
            except StopIteration:
                raise self.NoCombinationsLeft('Cannot find new unique combination for the given list') from None
        return self.checked[key]
 
    class NoCombinationsLeft(Exception):
 
        def __init__(self, exc_msg: str) -> None:
            super().__init__(exc_msg)
 
 
if __name__ == '__main__':
    cmb = Combination([1, 2, 3])
    while True:
        print(cmb.get_combination(int(input('key='))))

key=2
random.seed(key)
f=[1,2,3,4,5,6]
g=f.copy()
random.shuffle(g)
print(g)
key=3
random.seed(key)
g=f.copy()
random.shuffle(g)
print(g)