import bisect

N,Q = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
    A[i] *= -1
tmp_A = A.copy()
tmp_A.sort()

for _ in range(Q):
    x,y = map(int, input().split())
    l = bisect.bisect_right(tmp_A, A[x-1])
    r = bisect.bisect_left(tmp_A, A[y-1])
    if r-l<=0:
        print(0)
    else:
        print(r-l)