#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define ff first
#define ss second
void ono_max(int &MAX, int CMP) { if(CMP > MAX) MAX = CMP;}
void ono_min(int &MIN, int CMP) { if(CMP < MIN) MIN = CMP;}
int merge(
vi &edit, const int &st, const int &en,
const vi &L, const int &L_st, const int &L_en,
const vi &R, const int &R_st, const int &R_en) {
int ret = 0;
int cur_L = L_st, cur_R = R_st;
for(int i = st; i <= en; i++) {
if(cur_L == L_en + 1) {
edit[i] = R[cur_R];
cur_R++;
continue;
}
if(cur_R == R_en + 1) {
edit[i] = L[cur_L];
cur_L++;
continue;
}
if(L[cur_L] <= R[cur_R]) {
edit[i] = L[cur_L];
cur_L++;
}
else {
edit[i] = R[cur_R];
ono_max(ret, R[cur_R]);
cur_R++;
}
}
return ret;
}
const int mxn = 5050;
vector<vi> tmp(2, vi (mxn));
vi t(mxn), a(mxn);
int n, m;
pii query(int lvl, int l, int r) {
if(l == r) {
tmp[lvl][l] = a[l];
return {0, a[l]};
}
int m = (l + r) / 2;
pii L_qr = query((lvl + 1) % 2, l, m);
pii R_qr = query((lvl + 1) % 2, m + 1, r);
int MX = merge(
tmp[lvl], l, r,
tmp[(lvl + 1) % 2], l, m,
tmp[(lvl + 1) % 2], m + 1, r
);
int ans = 0;
ono_max(ans, L_qr.ff);
ono_max(ans, R_qr.ff);
if(MX != 0) ono_max(ans, MX + L_qr.ss);
return {ans, max(L_qr.ss, R_qr.ss)};
}
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> a[i];
while(m--) {
int l, r, k;
cin >> l >> r >> k;
pii q = query(0, l, r);
// cout << l << ' ' << r << ": " << q.ff << ' ';
cout << (q.ff <= k) << '\n';
}
return 0;
}
