#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 1e6;
int n, m, w[N + 2], cnt, lg2[N + 2];
struct nodA {
int inv, st, dr;
bool sorted;
} aint[4 * N + 2];
vector<int>all;
int ans = 0, mx = 0;
void build (int nod, int st, int dr) {
if (st == dr) {
aint[nod].inv = 0;
aint[nod].st = all.size();
all.push_back(w[st]);
aint[nod].dr = all.size();
aint[nod].sorted = 1;
return;
}
int mid = (st + dr) / 2;
build(2 * nod, st, mid);
build(2 * nod + 1, mid + 1, dr);
aint[nod].inv = max(aint[2 * nod].inv, aint[2 * nod + 1].inv);
auto it = lower_bound(all.begin() + aint[2 * nod + 1].st, all.begin() + aint[2 * nod + 1].dr, all[aint[2 * nod].dr - 1])-all.begin();
if (it != aint[2 * nod + 1].st) {
it--;
aint[nod].inv = max(aint[nod].inv, all[aint[2 * nod].dr - 1] + all[it]);
}
aint[nod].st = all.size();
int i = aint[2* nod].st, j = aint[2 * nod + 1].st;
while (i < aint[2 * nod].dr&& j < aint[2 * nod + 1].dr) {
if (all[i] == all[j]) {
int x = all[i];
all.push_back(all[i]);
all.push_back(all[i]);
i++;
j++;
}
else if (all[i]< all[j]) {
all.push_back(all[i]);
i++;
}
else if (all[i] > all[j]) {
all.push_back(all[j]);
j++;
}
}
while (i < aint[2 * nod].dr)
all.push_back(all[i++]);
while (j < aint[2 * nod + 1].dr)
all.push_back(all[j++]);
aint[nod].dr = all.size();
aint[nod].sorted = (aint[2 * nod].sorted & aint[2 * nod + 1].sorted & w[mid] <= w[mid + 1]);
}
int lastdr;
bool ok;
void query (int nod, int st, int dr, int a, int b) {
if (a <= st && dr <= b) {
if (mx == -1) {
ans = aint[nod].inv;
mx = max(mx, all[aint[nod].dr - 1]);
ok &= aint[nod].sorted;
lastdr = dr;
}
else {
ans = max(ans, aint[nod].inv);
int poz = aint[nod].st - 1;
int l = lg2[dr - st + 1];
for (int pas = (1 << (l + 1)); pas; (pas >>= 1))
if (poz + pas < aint[nod].dr && all[poz + pas] < mx)
poz += pas;
if (poz != aint[nod].st - 1) {
ans = max(ans, mx + all[poz]);
}
ok &= aint[nod].sorted;
ok &= (w[lastdr] <= w[lastdr + 1]);
mx = max(mx, all[aint[nod].dr - 1]);
lastdr = dr;
}
return;
}
int mid = (st + dr) / 2;
if (a <= mid)
query(2 * nod, st, mid, a, b);
if (b > mid)
query(2 * nod + 1, mid + 1, dr, a, b);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 2; i <= n; i++)
lg2[i] = lg2[i / 2] + 1;
for (int i = 1; i <= n; i++)
cin >> w[i];
build(1, 1, n);
for (int i = 1; i <= m; i++) {
int l, r, k;
cin >> l >> r >> k;
ans = mx = lastdr = -1;
ok = 1;
query(1, 1, n, l, r);
cout << (ans <= k) << "\n";
}
return 0;
}
