#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
namespace FastIO{
string buffer;
vector<int> king;
void init(int _n = 0){
getline(cin, buffer, '\0');
buffer += "\n";
king.reserve(_n);
int cur = 0;
for(char c: buffer){
if (c <= '9' && c >= '0'){
if (cur == -1) cur = 0;
cur = cur * 10 + (c - '0');
}
else{
if (cur != -1) king.push_back(cur);
cur = -1;
}
}
reverse(ALL(king));
}
int read(){
int u = king.back(); king.pop_back();
return u;
}
}
const int N = 1e6 + 69, INF = 2e9 + 69;
vector<array<int, 3>> queries[N];
struct FenwickTree{
int n;
vector<int> a;
FenwickTree(int _n){
n = _n;
a.resize(n+1);
}
void update(int i, int v){
while(i <= n){
maximize(a[i], v);
i += LASTBIT(i);
}
}
int get(int i){
int ans = 0;
while(i > 0){
maximize(ans, a[i]);
i -= LASTBIT(i);
}
return ans;
}
};
void solve(){
int n = FastIO::read(), q = FastIO::read();
vector<int> a(n+1);
for(int i = 1; i <= n; ++i) a[i] = FastIO::read();
vector<int> ans(q);
for(int i = 0; i < q; ++i){
int l = FastIO::read(), r = FastIO::read(), w = FastIO::read();
queries[r].push_back({{l, w, i}});
}
vector<int> st; st.reserve(n);
FenwickTree segg(n);
for(int i= 1; i <= n; ++i){
while(st.size() && a[st.back()] <= a[i])
st.pop_back();
if (st.size()){
int j = st.back();
segg.update(n - j + 1, a[j] + a[i]);
}
st.push_back(i);
for(auto j: queries[i]){
ans[j[2]] = (segg.get(n - j[0] + 1) <= j[1]);
}
}
printArr(ans, "\n", "");
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
FastIO::init(4e6);
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
