點下面的連結可以看美美的題目：

https://drive.google.com/file/d/1oHrVfAkhGMLuxNOpZscWNy4HX7ejm4GZ/view?usp=sharing

Capoo owns a street on which $N$ buildings lie in a row. The buildings are numbered $1$ to $n$ from left to right, and the $i$-th one has height $A_i$.

While taller buildings give more profit, they’ve got a major downside: the city’s view may get obstructed by them. Since Capoo likes to take afternoon walks on his street, he does not wish that the buildings are too tall, or they might block the awesome scenery of the city.

Capoo has planned his walks for the next $M$ days. On the $j$-th day, he will start from the $L_j$-th building, walk right to the $R_j$-th one, and admire the sublime views while walking. The “satisfiability” of the walk he will gain on day $j$ is given by the number of buildings between the $L_j$-th and the $R_j$-th one (inclusive) with height not greater than $K_j$.

Given the plans, Capoo wants to know the satisfiability for each day in advance. However, since he is not good at solving these type of problems (he always falls asleep during algorithm classes), he wants you to write a program to help him.

翻譯：

給定$1$~$n$每個點的高度，多次詢問某個$[L,R]$區間高度不大於$K$的點有幾個。