from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque,Counter
from math import ceil, floor, sqrt, factorial,gcd
from itertools import permutations, combinations,product
from bisect import bisect_left, bisect_right
from copy import deepcopy
from functools import lru_cache #@lru_cache(maxsize=None)
from fractions import Fraction
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline
vector1 = [[0, -1], [1, 0], [0, 1], [-1, 0]]
vector2 = [[0, 1], [1, 0], [-1, 0], [0, -1],
           [1,-1], [-1, 1], [1, 1], [-1, -1]]





def main():
    N,Q = map(int,input().split())
    A = list(map(int,input().split()))
    a = [[val,idx] for idx,val in enumerate(A)]
    a.sort(reverse=True)
    d = defaultdict(int)
    dist = defaultdict(int)
    for i,(val,idx) in enumerate(a):
        d[idx+1] = i
        dist[idx+1] = val
    
    #print(d)
    for _ in range(Q):
        x,y = map(int,input().split())
        if dist[x] <= dist[y]:
            print(0)
        else:
            print(d[y]-d[x]-1)
    
    


if __name__ == '__main__':
    main()