Unusual Queries

There are $N$ mountains in Chefland, arranged in a line and numbered $1$ through $N$ from left to right. For each valid $i$, the $i$-th mountain from the left has a height $H_i$. Chef wants to choose a contiguous sequence of mountains $l, l+1, \ldots, r$ and visit them in this order. He has a notebook where he writes down some heights of mountains. Initially, the notebook contains only the inte