#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int mod = 1e9 + 7, inf = 1e17;
struct node {
bool ok;
int mx, mn;
};
node merge(node a, node b) {
node c;
c.mx = max(a.mx, b.mx), c.mn = min(a.mn, b.mn), c.ok = a.ok && b.ok && a.mx <= b.mn;
return c;
}
struct segment_tree {
int n;
vector<node> t;
void build(vector<int> &a, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (l == r) t[v] = {true, a[l], a[l]};
else {
int m = (l + r) >> 1;
build(a, v << 1, l, m);
build(a, v << 1 | 1, m + 1, r);
t[v] = merge(t[v << 1], t[v << 1 | 1]);
}
}
segment_tree(vector<int> &a) : n(a.size()), t(n << 2) { build(a); }
node get(int L, int R, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (L <= l && r <= R) return t[v];
int m = (l + r) >> 1;
if (R <= m) return get(L, R, v << 1, l, m);
if (L > m) return get(L, R, v << 1 | 1, m + 1, r);
return merge(get(L, R, v << 1, l, m), get(L, R, v << 1 | 1, m + 1, r));
}
};
int32_t main() {
#ifdef JahonaliX
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, q, m;
cin >> n >> q;
vector<int> a(n);
for (int &i : a) cin >> i;
segment_tree s(a);
while (q--) {
int l, r, k;
cin >> l >> r >> k, l--, r--;
cout << s.get(l, r).ok << '\n';
}
return 0;
}
