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

cnt=[0 for _ in range(N)]
S=[0 for _ in range(N+1)]
for i in range(N):
    cnt[C[i]]+=1
for i in range(N):
    S[i+1]=S[i]+cnt[i]

# print(*S)

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