시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
7 초 512 MB 0 0 0 0.000%

## 문제

You own a very peculiar bookstore, which sells old books, but you store all of them on a single shelf, in random order, and you do not care about the books’ content. Nor do your clients – they tend to come into the store and simply ask for “all the books on that shelf, starting from this one and ending here”. To be precise, every client buys some connected (and non-empty) fragment of books from the shelf.

Sometimes, though, you get more picky clients, who expect more from a book – actually, they expect it to have the right size. A picky client wants a fragment of shelf in which all the books have their height not smaller than l and not greater than h.

Given a sequence of integers – the heights of all the books on the shelf – determine the number of possible connected fragments which satisfy these requirements.

Also, we mentioned that the books are in random order. Formally, the input sequence was generated with the following program, for some values of N ∈ {1, 2, . . . , 100 000} and M = 10q with q ∈ {1, 2, . . . , 6}.

srand48(N + M);
for (int i = 0; i < N; ++i)
a[i] = 1 + lrand48() % M;

You do not actually need to know how the RAND48 library works. It is enough to assume that the function lrand48 returns 31-bit non-negative integers picked uniformly at random.

## 입력

The first line of input contains the number of test cases z (1 ≤ z ≤ 5). The test cases follow, each one in the following format:

The first line of a test case contains the number of books n and the number of picky clients k (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 500 000).

The second line contains a sequence of n positive integers not exceeding 1 000 000 – the heights of all the books, from the first (leftmost) to the last (rightmost) one.

The final k lines describe the clients’ requirements. The i-th of these lines contains two integers li, hi (1 ≤ lihi ≤ 1 000 000), describing a client that wants books to be not smaller than li and not greater than hi.

The total number of books in all test cases does not exceed 600 000, and the total number of clients in all test cases does not exceed 1 500 000.

## 출력

For every client, output the number of non-empty connected fragments of the book sequence which safisty the client’s requirements.

## 예제 입력 1

2
10 3
9 9 3 2 1 9 6 9 1 7
1 13
6 6
2 9
5 1
66575 45720 67904 18764 35162
20000 80000


## 예제 출력 1

55
1
17
7