def permutation_by_number(items, n):
  items = sorted(items)
  pile = []
  for k in range(len(items)):
    n, d = divmod(n, k+1)
    pile.append(d)
  pile.reverse()
  result = []
  for k in pile:
    result.append(items.pop(k))
  return result