Diff by 2

A set $C$ is said to be good if for every $2$ distinct elements $x$ and $y$ belonging to the set, either $2 \cdot x < y$ or $2 \cdot y < x$ is true. --- You are given an array $A$ of $N$ integers where $A_1 \le A_2 \le \ldots \le A_N$. You are also given a parameter $S$, and $Q$ queries. In each query: - You are given $2$ integers $L$ and $R$. Consider the subarray $[A_L, A_{L + 1}, \ldots, A_R