This script is a solution to an algorithmic problem with applications in competitive programming, search systems, sequence generation, and educational tools. Its primary purpose is to efficiently find the k-th lexicographically ordered number in a sequence up to n, making it valuable in scenarios where sorting and storing all numbers is impractical. The approach demonstrates optimization techniques that are broadly applicable in computer science and software engineering.