Company: rubrik_4oct
Difficulty: medium
Maximum Security Clearance Problem Description You're a cybersecurity engineer at a top-tier firm, tasked with a critical component of a new distributed secure encryption system. In this system, the data is stored at different security levels, represented as an m-bit integer. For certain high-privilege operations, such a full system-wide backup restoration, a process needs to acquire a 'Maximum Security Clearance'. This clearance is achieved when the bitwise OR of the security levels of a consecutive sequence of data chunks equals 2 m - 1 (a bitmask with all m bits set to 1). Your mission is to develop an efficient algorithm to identify the shortest possible continuous sequence of data chunks that collectively grant the Maximum Security Clearance. Input Format Each input contains multiple test cases. The first line contains a single integer t indicating the number of test cases. The first line of each test case contains two space-separated integers, n and m, where n is the total number