from bisect import bisect_left, bisect_right


def main():
    N, Q = map(int, input().split())
    A = list(map(int, input().split()))
    A_sorted = sorted(map(lambda elm: -elm, A))

    for _ in range(Q):
        x, y = map(lambda n: int(n) - 1, input().split())
        idx_x = bisect_right(A_sorted, -A[x])
        idx_y = bisect_left(A_sorted, -A[y])
        print(max(0, idx_y - idx_x))


if __name__ == "__main__":
    main()