#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 5005;
ll n, m;
ll a[N], def[N], dp[N][N];
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
def[i] = a[i];
}
for(int i=1;i<=n;i++){
dp[i][i] = 0;
for(int j=i+1;j<=n;j++){
dp[i][j] = dp[i][j-1];
if(a[j-1] > a[j]) dp[i][j] = max(dp[i][j], a[j-1] + a[j]);
}
}
//for(int i=1;i<=n;i++){
// for(int j=i;j<=n;j++){
// cout<<dp[i][j]<<" ";
// }cout<<"\n";
//}
while(m--){
for(int i=1;i<=n;i++) a[i] = def[i];
ll l, r, k;
cin>>l>>r>>k;
if(dp[l][r] > k) cout<<0<<"\n";
else cout<<1<<"\n";
}
return;
}
signed main(){
fastios
int t = 1;
//cin>>t;
while(t--) solve();
return 0;
}
