n, Q = map(int, input().split())
A = list(map(int, input().split()))

stack = [(n, 1 << 60)]
nex = [[n] * (n + 1) for _ in range(30)]
for i in range(n - 1, -1, -1):
    a = A[i]
    while stack[-1][1] < a:
        stack.pop()
    nex[0][i] = stack[-1][0]
    stack.append((i, a))

for i in range(1, 30):
    for j in range(n):
        nex[i][j] = nex[i - 1][nex[i - 1][j]]

for _ in range(Q):
    _, l, r = map(int, input().split())
    l -= 1
    r -= 1
    ans = 1
    for i in range(29, -1, -1):
        if nex[i][l] <= r:
            l = nex[i][l]
            ans += 1 << i
    print(ans)