#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+10;
const long long inf = 2e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int n, m, a[N], u[N], sta[20][N], LOG[N], ans[N];
int ql[N], qr[N], qk[N];
vector<int> q[N];
int getmx (int l, int r) {
if(l > r) return 0;
int j = LOG[r - l + 1];
return max(sta[j][l], sta[j][r-(1<<j)+1]);
}
struct tre {
int mx, ans;
} t[N * 4];
tre combine(tre a, tre b) {
tre c;
c.mx = max(a.mx, b.mx);
c.ans = max(a.ans, b.ans);
return c;
}
void build(int v, int tl, int tr) {
u[v] = -1;
if(tl == tr) {
t[v] = {a[tl], 0};
return;
}
int tm = (tl + tr) / 2;
build(v + v, tl, tm);
build(v + v + 1, tm + 1, tr);
t[v] = combine(t[v + v], t[v + v + 1]);
}
void push(int v, int tl, int tr){
if(u[v] != -1) {
t[v].ans = t[v].mx + u[v];
if(tl != tr) {
u[v + v] = u[v];
u[v + v + 1] = u[v];
}
u[v] = -1;
}
}
void update(int v, int tl, int tr, int l, int r, int x) {
push(v, tl, tr);
if(tl > r || l > tr) return;
if(l <= tl && tr <= r) {
u[v] = x;
push(v, tl, tr);
return;
}
int tm = (tl + tr) / 2;
update(v + v, tl, tm, l, r, x);
update(v + v + 1, tm + 1, tr, l, r, x);
t[v] = combine(t[v + v], t[v + v + 1]);
}
tre get(int v, int tl, int tr, int l, int r) {
push(v, tl, tr);
if(tl > r || l > tr) return {0, 0};
if(l <= tl && tr <= r) return t[v];
int tm = (tl + tr) / 2;
return combine(get(v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r));
}
void Baizho() {
for(int i = 2; i < N; i ++) LOG[i] = LOG[i / 2] + 1;
cin>>n>>m;
for(int i = 1; i <= n; i ++) {
cin>>a[i];
sta[0][i] = a[i];
}
build(1, 1, n);
for(int j = 1; j <= 19; j ++) {
for(int i = 1; i+(1<<j)-1 <= n; i ++) {
sta[j][i] = max(sta[j-1][i], sta[j-1][i+(1<<j-1)]);
}
}
for(int i = 1; i <= m; i ++) {
cin>>ql[i]>>qr[i]>>qk[i];
q[ql[i]].pb(i);
}
for(int i = n; i >= 1; i --) {
int l = i + 1, r = i;
int bl = i + 1, br = n;
while(bl <= br) {
int mid = (bl + br) / 2;
if(getmx(i + 1, mid) < a[i]) bl = mid + 1, r = mid;
else br = mid - 1;
}
if(l <= r) {
update(1, 1, n, l, r, a[i]);
// cout<<i<<" "<<l<<" "<<r<<"\n";
}
for(auto j : q[i]) {
ans[j] = (get(1, 1, n, ql[j], qr[j]).ans <= qk[j]);
}
}
for(int i = 1; i <= m; i ++) cout<<ans[i]<<"\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) { Baizho(); }
}
