ll@N,@A[N],@Q;set<ll>I{N},D{N};rep(i,N-1){if(A[i]<A[i+1])I.insert(i);else if(A[i]>A[i+1])D.insert(i);}while(Q--){ll@l,@r,s,t;s=*D.lower_bound(l)>=r,t=*I.lower_bound(l)>=r;wt(s,t);}