You are given an array of length and an integer . You are required to find all the subarrays of minimum length with BITWISE OR greater than or equal to .
Input format
Output format
For each test case:
In the first line, print count of such subarrays (let it be C). In the next C lines, print all the subarrays (in sorted order).
Note: A subarray can be defined by 2 indexes L and R where and are starting and ending indexes of that subarray)
Constraints
1 ≤ T ≤ 3
1 ≤ N ≤ 10^5
0 ≤ A[i] ≤ 10^9
0 ≤ X ≤ 1073741823