#include <bits/stdc++.h>
using namespace std;

// 0-indexed
template <class T>
struct SegmentTree {
  // a,b,c: T, e:T(unit)
  // abc = (ab)c = a(bc)
  // ae = ea = a
  typedef function<T(T, T)> F;
  int n;
  F f;
  T unit;
  vector<T> dat;
  SegmentTree(){};
  SegmentTree(int newn, F f, T t) : f(f), unit(t) { init(newn); }
  SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {
    int _n = v.size();
    init(v.size());
    for (int i = 0; i < _n; ++i) dat[n + i] = v[i];
    for (int i = n - 1; i; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);
  }
  void init(int newn) {
    n = 1;
    while (n < newn) n <<= 1;
    dat.assign(n << 1, unit);
  }

  // "go up" process
  void update(int k, T newdata) {
    dat[k += n] = newdata;
    while (k >>= 1) {
      dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);
    }
  }
  // [a,b)
  T query(int a, int b) {
    T vl = unit, vr = unit;
    for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) vl = f(vl, dat[l++]);
      if (r & 1) vr = f(dat[--r], vr);
    }
    return f(vl, vr);
  }
};

using P = pair<int, int>;

int n, q;
vector<P> v;
vector<vector<int>> dp;
SegmentTree<P> seg;

int main() {
  cin >> n >> q;
  v.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> v[i].first;
    v[i].second = i;
  }
  v.emplace_back(n + 1, n);
  {  // make seg
    auto f = [](P l, P r) { return max(l, r); };
    seg = SegmentTree<P>(v, f, P(-1, -1));
  }
  {  // dp
    auto binary = [](int id) {
      int l = id, r = n;
      while (r - l > 1) {
        int mid = (l + r) / 2;
        if (seg.query(id, mid + 1).second > id)
          r = mid;
        else
          l = mid;
      }
      return r;
    };
    dp.assign(n + 1, vector<int>(31, n));
    for (int i = 0; i < n; ++i) dp[i][0] = binary(i);
    for (int i = n - 1; i >= 0; --i)
      for (int j = 0; j < 30; ++j) dp[i][j + 1] = dp[dp[i][j]][j];
  }
  {  // query
    auto calc = [](int l, int r) {
      int res = 1;
      for (int i = 30; i >= 0; --i)
        if (dp[l][i] < r) {
          l = dp[l][i];
          res += 1 << i;
        }
      return res;
    };
    for (int i = 0; i < q; ++i) {
      int a, b, c;
      cin >> a >> b >> c;
      cout << calc(b - 1, c) << endl;
    }
  }
  return 0;
}