import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1
    
    A = list(map(int, input[ptr:ptr+N]))
    ptr += N
    sorted_A = sorted(A)
    
    for _ in range(Q):
        x = int(input[ptr])
        ptr += 1
        y = int(input[ptr])
        ptr += 1
        
        a = A[x-1]
        b = A[y-1]
        
        if a <= b:
            print(0)
        else:
            left = bisect.bisect_right(sorted_A, b)
            right = bisect.bisect_left(sorted_A, a)
            print(right - left)
            
if __name__ == "__main__":
    main()