import bisect
n,q=map(int,input().split())
a=list(map(int,input().split()))
b=sorted(a)
for i in range(q):
	x,y=map(int,input().split())
	x-=1
	y-=1
	if a[x]<=a[y]:
		print(0)
	else:
		f = bisect.bisect_right(b,a[y])
		g = bisect.bisect_left(b,a[x])
		print(g-f)