|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|5 초||512 MB||1||1||1||100.000%|
Denisson is an average enjoyer of Matryoshka dolls. A set of matryoshkas consists of a wooden figure, which separates at the middle, top from bottom, to reveal a smaller figure of the same sort inside, which has, in turn, another figure inside of it, and so on.
Recently he bought a set of these toys and placed them on the table in some order. There are exactly $n$ dolls of different sizes in his set, so the current order of matryoshkas can be represented as a permutation $p$ of length $n$, where $p_i$ is equal to the size of $i$-th doll.
Denisson usually has a very tight schedule, but today he wants to relax with his toys, and will play the following game:
Suddenly, he realized that his interesting game could last for a very long time, but he really cares about his schedule. He came to you with $q$ different segments $[l_i, r_i]$ and wonders what time he needs to play the game on each of these segments. He hopes that you will not spend too much time finding it out.
The first line contains two integers $n$ and $q$ --- the number of matryoshkas and the number of requests ($1 \leq n \leq 10^5$, $1 \leq q \leq 5 \cdot 10^5$).
The second line describes the order of the matryoshkas represented as a permutation $p$ ($1 \leq p_i \leq n$).
The following $q$ lines describe requests in the order they are received. Each request is described by two integers $l_i$ and $r_i$ ($1 \le l_i \le r_i \le n$) --- endpoints of the $i$-th segment.
For $i$-th request, print the total time needed to play the game on segment $[l_i, r_i]$.
5 5 1 5 2 4 3 1 5 1 4 1 3 1 2 1 1
7 5 3 1 0