#include <bits/stdc++.h>
#ifdef LOCAL
#include <bits/debug.hpp>
#endif // LOCAL
#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "Hedgehog Daniyar and Algorithms"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 2e5 + 7
using namespace std;
const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;
int n, q;
struct QUERY { int l, r, k; } qr[maxn];
int a[maxn];
namespace TRAU {
int calc(int l, int r) {
int Max = -1e9, ans = 0;
fi(i, l, r) {
if(a[i] < Max) ans = max(ans, a[i] + Max);
Max = max(Max, a[i]);
}
return ans;
}
void solve() {
fi(i, 1, q) {
int l = qr[i].l, r = qr[i].r, k = qr[i].k;
cout << (calc(l, r) <= k) << '\n';
}
}
}
void solve()
{
cin >> n >> q;
fi(i, 1, n) cin >> a[i];
fi(i, 1, q) cin >> qr[i].l >> qr[i].r >> qr[i].k;
TRAU::solve();
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(Neco".inp", "r")) {
freopen(Neco".inp", "r", stdin);
freopen(Neco".out", "w", stdout);
}
int nTest = 1;
// cin >> nTest;
while(nTest--)
{
solve();
}
return 0;
}
