import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum E = 18;

int N, Q;
int[] A;
int[] L, R;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      L = new int[Q];
      R = new int[Q];
      foreach (q; 0 .. Q) {
        readInt();
        L[q] = readInt() - 1;
        R[q] = readInt();
      }
      
      auto f = new int[][](E, N + 1);
      f[0][N] = N;
      
      auto ps = new Tuple!(int, int)[N];
      foreach (i; 0 .. N) {
        ps[i] = tuple(A[i], i);
      }
      sort(ps);
      auto set = new RedBlackTree!int;
      set.insert(N);
      foreach_reverse (p; ps) {
        const i = p[1];
        f[0][i] = set.upperBound(i).front;
        set.insert(i);
      }
      
      foreach (e; 1 .. E) {
        foreach (i; 0 .. N + 1) {
          f[e][i] = f[e - 1][f[e - 1][i]];
        }
      }
      debug {
        foreach (e; 0 .. E) {
          writefln("f[%s] = %s", e, f[e]);
        }
      }
      foreach (q; 0 .. Q) {
        debug {
          writefln("query [%s, %s)", L[q], R[q]);
        }
        int ans;
        int i = L[q];
        foreach_reverse (e; 0 .. E) {
          if (f[e][i] < R[q]) {
            ans |= 1 << e;
            i = f[e][i];
          }
        }
        ++ans;
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}