Partially Increasing Array Queries

An array $B$ of size $M$ is called *partially increasing* if there exists an index $i$ such that: - $ 1 \lt i \lt M $ - $ B_{i - 1} \leq B_i \leq B_{i + 1} $ For example, $[1, 2, 4, 8], [1, 2, 8, 4], $ and $[7, 6, 5, 5, 7]$ are partially increasing, while $[1, 2, 1, 3], [1, 2], $ and $[7, 6, 5, 6]$ are not. You are given an array $A$ of size $N$, and $Q$ queries each containing a pair of integer