# 入力例1であれば2番が1番に追いつくには7と20の間に数字が何個あるか数えればいい
# bisect_right, bisect_leftでどうか

N, Q = map(int, input().split())
A = list(map(int, input().split()))
A_sorted = sorted(A)

from bisect import bisect_right, bisect_left

ans_list = []
for q in range(Q):
    x, y = map(int, input().split())
    x_idx = bisect_left(A_sorted, A[x-1])
    y_idx = bisect_right(A_sorted, A[y-1])
    #print('x', x, 'y', y, 'x_idx', x_idx, 'y_idx', y_idx)
    ans = max(x_idx - y_idx, 0)
    print(ans)