# Dylans loves sequence

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 131072/131072 K (Java/Others)

## Description

Dylans is given $N$ numbers $a[1]....a[N]$

And there are $Q$ questions.

Each question is like this $(L,R)$

his goal is to find the “inversions” from number $L$ to number $R$.

more formally,his needs to find the numbers of pair（$x,y$）,
that $L \leq x,y \leq R$ and $x < y$ and $a[x] > a[y]$

## Input

In the first line there is two numbers $N$ and $Q$.

Then in the second line there are $N$ numbers:$a[1]..a[N]$

In the next $Q$ lines,there are two numbers $L,R$ in each line.

$N \leq 1000, Q \leq 100000, L \leq R, 1 \leq a[i] \leq 2^{31}-1$

## Output

For each query,print the numbers of "inversions”

## Sample Input

3 2
3 2 1
1 2
1 3

## Sample Output

1
3

Hint
You shouldn't print any space in each end of the line in the hack data.


hujie

## Source

BestCoder Round #45