给定一个长度为 $N$ 的数列 $A_1, A_2, \ldots, A_N$。请编写一个程序来处理以下查询：
s e：输出满足 $s \le i < j \le e$ 且 $A_i > A_j$ 的 $(i, j)$ 对的个数。($1 \le s \le e \le N$)第一行包含数列的长度 $N$ ($1 \le N \le 100{,}000$) 和查询的个数 $M$ ($1 \le M \le 100{,}000$)。
第二行包含 $A_1, A_2, \ldots, A_N$。($1 \le A_i \le 1{,}000{,}000{,}000$)
接下来 $M$ 行，每行包含一个查询。
对于每个查询，输出其答案，每个答案占一行。
5 3 1 4 2 3 1 1 2 3 5 1 5
0 2 5
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: