#include<bits/stdc++.h>
#define INF 1e18
#define fi first
#define se second
#define FOR(i, k, n) for(ll i = k; i <= n; i++)
#define FOR1(i, k, n) for(ll i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "BAI1.inp"
#define output "BAI1.out"
#define rf freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
int a[maxn];
int main()
{
fastio;
int n, m;
cin >> n >> m;
FOR(i, 1, n)
cin >> a[i];
while(m--)
{
int l, r, x;
cin >> l >> r >> x;
int ans = 0;
int maxx = a[l];
FOR(i, l + 1, r)
{
if(a[i] < maxx)
ans = max(ans, maxx + a[i]);
else
maxx = a[i];
}
cout << (ans <= x) << "\n";
}
re;
}
