#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
#define ll long long
using namespace std;
const int N=1e6+7, M=1e9+7;
ll a[N], dp[N];
void solve()
{
ll n, m, mn=1e18;
cin >> n >> m;
for (int i=1;i<=n;i++) cin >> a[i], mn=min(mn, a[i]), dp[i]=1;
for (int i=2;i<=n;i++) {
if (a[i] >= a[i-1]) dp[i]+=dp[i-1];
else dp[i]=dp[i-1];
}
while (m--){
ll l, r, k;
cin >> l >> r >> k;
if (mn > k){
if (dp[r]-dp[l-1] == n) cout <<"1\n";
else cout << "0\n";
continue;
}
bool ok=1;
for (int i=l;i<=r;i++){
for (int j=i+1;j<=r;j++){
if (a[i] > a[j] && a[i]+a[j] > k){
ok=0;
break;
}
}
if (!ok) break;
}
cout << ok <<"\n";
}
return ;
}
int main()
{
ios;
int t=1;
// cin >> t;
while (t--){
solve();
cout <<"\n";
}
return 0;
}
