Permutations III

Given a sequence (possibly containing duplicate elements), compute its unique permutations—either enumerate all distinct permutations or return the k-th permutation in lexicographic order. The challenge is to handle duplicates correctly and efficiently, avoiding redundant generation and using combinatorial ordering or pruned backtracking to scale.