Finding the Kth Fortunate Number in a Range

Problem Preview

"You are given three integers L, R, and K. A number X is deemed a fortunate number if its binary form contains the subsequence '101'. Your task is to identify the Kth fortunate number that falls between L and R. If there is no Kth fortunate number within the specified range, return -1. ### Function Description: You are required to implement the function solve that accepts three parameters and returns the Kth fortunate number within the range defined by L and R. ### Parameters: - L: An integer representing the lower limit of the range. - R: An integer representing the upper limit of the range. - K: An integer representing which fortunate number (the Kth one) is to be found. ### Input Format: - The first line of input contains an integer T, which indicates the number of test cases. - For each test case, the first line contains three space-separated integers L, R, and K. ### Output Format: - For each test case, print the Kth fortunate number within the range [L, R] on a new line. If such a number doesn't exist, print -1."