from bisect import bisect_left, bisect_right

N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]

S = sorted(A)
for i in range(Q):
    x, y = query[i]
    if A[x-1] <= A[y-1]:
        print(0)
    else:
        print(bisect_left(S, A[x-1])-bisect_right(S, A[y-1]))