시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 97 67 61 69.318%

문제

Farmer John has just arranged his N haybales (1≤N≤100,000) at various points along the one-dimensional road running across his farm. To make sure they are spaced out appropriately, please help him answer Q queries (1≤Q≤100,000), each asking for the number of haybales within a specific interval along the road.

 

입력

The first line contains N and Q.

The next line contains N distinct integers, each in the range 0…1,000,000,000, indicating that there is a haybale at each of those locations.

Each of the next Q lines contains two integers A and B (0≤A≤B≤1,000,000,000) giving a query for the number of haybales between A and B, inclusive.

출력

You should write Q lines of output. For each query, output the number of haybales in its respective interval.

예제 입력 1

4 6
3 2 7 5
2 3
2 4
2 5
2 7
4 6
8 10

예제 출력 1

2
2
3
4
1
0

힌트