#MMA Contest 018 E

from bisect import bisect_left as bL, bisect_right as bR

N, Q = map(int, input().split())
A = list(map(int, input().split()))
D = dict()
for a in A:
    if a not in D:
        D[a] = 0
    D[a] += 1
K = sorted( D.keys() )
B = [D[k] for k in K]
C = [0] * (len(B) + 1)
for i in range(len(B)):
    C[i + 1] = C[i] + B[i]
del D
D = {j: i for i, j in enumerate(K)}

for _ in range(Q):
    x, y = map(lambda x: int(x) - 1, input().split())
    Ax, Ay = D[ A[x] ], D[ A[y] ]
    if Ay >= Ax:
        print(0)
    else:
        print(C[Ax] - C[Ay + 1])