#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e6+5;
const int inf = 2e9 + 10;
int n, m;
int a[mxn] = {};
struct segtree {
int tree[4*mxn];
void build(int node,int b,int e) {
if(b == e) {
tree[node] = a[b];
return;
}
int mid = b + e >> 1;
int left = node << 1;
int right = left | 1;
build(left, b, mid);
build(right, mid + 1, e);
tree[node] = min(tree[left], tree[right]);
}
int query(int node,int b,int e,int l,int r) {
if(e<l || b>r) return inf;
if(b >= l && e <= r) return tree[node];
int mid=b+e>>1;
int left=node<<1;
int right=left|1;
return min(query(left, b, mid, l, r), query(right, mid + 1, e, l, r));
}
} st;
struct BIT
{
int bit[mxn] = {};
void update(int p,int v) {
if(p==0) return;
for(;p<mxn;p+=p&-p) bit[p] += v;
}
int query(int p) {
int r = 0;
for(;p > 0; p -= p&-p) r += bit[p];
return r;
}
int query(int l, int r) {
return query(r) - query(l - 1);
}
} bt, dn;
int main() {
cin >> n >> m;
vector<pii> b;
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b.emplace_back(a[i], i);
}
st.build(1, 1, n);
vector< tuple<int, int, int, int> > query;
for(int i = 1; i <= m; i++) {
int l, r, k;
scanf("%d%d%d", &l, &r, &k);
int mn = st.query(1, 1, n, l, r);
int v = k - mn;
query.emplace_back(v, l, r, i);
}
sort(query.begin(), query.end(), greater<tuple<int, int, int, int> >());
sort(b.begin(), b.end(), greater<pii>());
int pt = 0;
bool res[m + 1];
for(auto [v, l, r, i] : query) {
while(pt < n && b[pt].first > v) {
auto [val, ind] = b[pt];
pt++;
if(a[ind] >= a[ind - 1]) bt.update(ind, 1);
dn.update(ind, 1);
}
int tot = dn.query(l, r);
if(tot == r - l + 1) res[i] = (bt.query(l + 1, r) == tot - 1);
else res[i] = (bt.query(r - tot + 1, r) == tot);
}
for(int i = 1; i <= m; i++) {
printf("%d\n", res[i]);
}
}
