#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define sz(x) (int)x.size()
const char nl = '\n';
void solve() {
int n, m; cin >> n >> m;
vector<int> a(n);
for (auto &i: a)cin >> i;
while (m--) {
int l, r, k; cin >> l >> r >> k;
--l; int mx = a[l];
bool res = true;
rep(j, l+1, r)
if (mx > a[j] && mx+a[j] > k){res = false; break;}
else mx = max(mx, a[j]);
cout << res << nl;
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
