import sys
input = sys.stdin.readline
from heapq import *

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n
 
    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p
 
    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)
 
    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s
    
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x

N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = [[] for i in range(N)]
for i in range(Q):
    _, l, r = map(int, input().split())
    query[l - 1].append((r, i))

ans = [-1] * Q
T = Fenwick_Tree(N)
H = []
for i in range(N - 1, -1, -1):
    while H:
        if H[0][0] < A[i]:
            v, ib = heappop(H)
            T.add(ib, -1)
        else:
            break
    T.add(i, 1)
    heappush(H, (A[i], i))
    for r, iq in query[i]:
        ans[iq] = T.sum(i, r)
    
for a in ans:
    print(a)