from bisect import bisect_left

n, q = map(int, input().split())
a = list(map(int, input().split()))
b = sorted(set(a))

cnt = [-1]*n
for i, ai in enumerate(a):
    junnni = bisect_left(b, ai)
    cnt[i] = junnni
for _ in range(q):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    print(max(0, cnt[x]-cnt[y]-1))