import bisect
N,Q=list(map(int,input().split()))
A=list(map(int,input().split()))

B=A[:]
B=list(set(B))
B.sort()

C=[0 for _ in range(N)]
for (i,a) in enumerate(A):
    idx=bisect.bisect_left(B,a)
    C[i]=idx

for _ in range(Q):
    x,y=list(map(int,input().split()))
    x-=1
    y-=1
    pos_x=C[x]
    pos_y=C[y]
    if pos_x<=pos_y:print(0)
    else:print(pos_x-pos_y-1)