RANGEGCD

You are given an array of $N$ positive integers. All the numbers in the array are powers of 2. Given $Q$ queries $q_1, q_2, \cdots, q_Q$, consider all the ranges $l_j, r_j$ such that $r_j-l_j=q_i$. For each query find a range, $l_p$ and $r_p$ such that $r_p - l_p = q_i$ and the GCD of all the numbers in the range is the maximum amongst all such ranges that follow the restriction. Note : You only