Get the Segment

**This is an interactive problem.** There’s a hidden array $A$ of size $N$. Each element of the array is either $1$ or $2$. Your task is to find **any** subarray with sum $K$. To do that, you can ask certain queries. In each query, you choose two positive integers $L$ and $R$ $(1 \leq L \leq R \leq N)$. The judge will reply with $\Sigma^{R}_{i=L}A_i$, that is, the sum of the subarray $A[L,R]