30 chairs

After his unsuccessful attempt to acquire chairs, Ostap remained optimistic and set off on a new quest. He learned of an auction nearby where $n$ antique chairs were up for sale. Eager to try his luck, he decided to see if any hidden treasures might be concealed within one of them. Upon arriving at the auction, Ostap realized he had just enough money to purchase exactly $k$ out of the $n$ chairs. Believing his luckiest number to be $m$, Ostap seeks your assistance once more. He asks you to determine the $m$-th combination of $k$ chairs from the $n$ available.