Find all valid combinations of `k` numbers that sum to `n`, where only digits `1` through `9` are used and **each digit is used at most once**.
Return the combinations with elements ascending, listed in lexicographic order. Each combination must be unique.