#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
    for (int i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "\n" : " ");
    }
    return os;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
    t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
    for (auto &e : t) {
        fill_v(e, v);
    }
};

struct Segtree {
    int n;
    vector<vector<ll>> dat;
    Segtree(int n_) {
        n = 1;
        while (n < n_) {
            n <<= 1;
        }
        dat.resize(2 * n);
    }
    /* void upd(int k, int x) {
         k += n;
         dat[k] = x;
         k >>= 1;
         while (k > 0) {
             dat[k] = dat[k << 1] + dat[k << 1 | 1];
             k >>= 1;
         }
     }*/
    void build(vector<int> &a) {
        for (int i = n; i < 2 * n; i++) {
            dat[i].emplace_back(a[i - n]);
        }
        for (int i = n - 1; i >= 1; i--) {
            for (auto &e : dat[i * 2]) {
                dat[i].emplace_back(e);
            }
            for (auto &e : dat[i * 2 + 1]) {
                dat[i].emplace_back(e);
            }
            sort(all(dat[i]));
        }
    }
    ll get(int a, int b, int x, int k, int l, int r) {
        if (b <= l || r <= a) {
            return 0;
        }
        if (a <= l && r <= b) {
            int s = lower_bound(all(dat[k]), x) - dat[k].begin();
            return s;
        }
        return get(a, b, x, 2 * k, l, (l + r) / 2) +
               get(a, b, x, 2 * k + 1, (l + r) / 2, r);
    }
    ll get(int a, int b, int x) {
        if (a >= b) {
            return 0;
        }
        return get(a, b, x, 1, 0, n);
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<int> a(n), b(n, -1);
    vector<P> v;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        v.push_back(P(a[i], i));
    }
    sort(all(v));
    reverse(all(v));
    set<int> st;
    for (int i = 0; i < n; i++) {
        int id = v[i].second;
        if (st.empty() || (*st.begin()) > id) {
            st.insert(id);
            continue;
        }
        auto it = st.lower_bound(id);
        --it;
        b[id] = *it;
        st.insert(id);
    }
    Segtree seg(n);
    seg.build(b);
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        --l;
        cout << seg.get(l, r, l) << endl;
    }
}