Beshiiiiiii Kore

$X = \frac{GXP(W_l…W_j, p}{GXP(W_{j+1}…W_r} \ge m^k$

Or, $GXP(W_l…W_j, p) \ge m^k * GXP(W_{j+1}…W_r, p)$

Or, $W_{l}^p*…W_{j}^p \ge m^k * W_{j+1}^p*…W_{r}^p$

Or, $log(W_{l}^p* … * W_{j}^p) \ge log(m^k * W_{j+1}^p* … *W_{r}^p)$

Or, $p * [log(W_{l}) + … + log(W_{j})) \ge k*log(m) + p * [log(W_{j+1}) + … + log(W_{r}))]$

Taking prefix sum of the logarithms of the values of $W$ array, and then use binary search to get the minimized solution

Time Complexity = $O(QlogN)$