n, q = map(int, input().split())
a = list(map(int, input().split()))
query = [list(map(lambda x: int(x)-1, input().split())) for _ in range(q)]

def solve(n, q, a, query):
  ls = sorted(list(set(a)), reverse = True)
  idx = dict()
  for i in range(len(ls)):
    idx[ls[i]] = i + 1
  s = [0] * (n + 1)
  for i in range(n):
    s[idx[a[i]]] += 1
  for i in range(n):
    s[i+1] += s[i]
  res = []
  for x, y in query:
    res.append(max(0, s[idx[a[y]]-1]-s[idx[a[x]]]))
  
  return res

def naive(n, q, a, query):
  res = []
  for x, y in query:
    cnt = 0
    for ai in a:
      cnt += a[x] > ai > a[y]
    res.append(cnt)
  
  return res

print(*solve(n, q, a, query), sep = "\n")
# print(naive(n, q, a, query))

exit()

import random
for _ in range(20):
  n = 5
  q = 1
  a = [random.randint(1, 5) for _ in range(n)]
  for i in range(n):
    for j in range(n):
      if i == j:
        continue
      query = [[i, j]]
      if solve(n, q, a, query) != naive(n, q, a, query):
        print("=" * 10)
        print(n, q)
        print(*a)
        for i in range(q):
          print(*[val+1 for val in query[i]])
        exit()