#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define mp make_pair
#define pb push_back
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define ins insert
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define sz(v) (ll)v.size()
#define readgraph(list, edges) for (ll i = 0; i < edges; i++) {ll a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define F_OR(i, a, b, s) for (ll i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
while (lb < rb) {
ll mb = (lb + rb) / 2;
f(mb) ? rb = mb : lb = mb + 1;
}
return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
while (lb < rb) {
ll mb = (lb + rb + 1) / 2;
f(mb) ? lb = mb : rb = mb - 1;
}
return lb;
}
void yn(bool t) {
if (t)cout << "YES" << endl;
else cout << "NO" << endl;
}
ll getmax(ll l, ll r, ll (*check)(ll)) {
ll lo = l, hi = r;
while (lo < hi) {
ll mid = (hi + lo) >> 1;
if (check(mid) > check(mid + 1))
hi = mid;
else
lo = mid + 1;
}
return check(hi);
}// returns maximum//returns maximum
ll getmin(ll l, ll r, ll (*check)(ll)) {
ll lo = l, hi = r;
while (lo < hi) {
ll mid = (hi + lo) >> 1;
if (check(mid) < check(mid + 1))
hi = mid;
else
lo = mid + 1;
}
return check(hi);
}// returns minimum//returns minimum
#ifndef DEBUG_TEMPLATE_CPP
#define DEBUG_TEMPLATE_CPP
#include <bits/stdc++.h>
// #define cerr cout
namespace __DEBUG_UTIL__
{
using namespace std;
/* Primitive Datatypes Prll */
void print(const char *x) { cerr << x; }
void print(bool x) { cerr << (x ? "T" : "F"); }
void print(char x) { cerr << '\'' << x << '\''; }
void print(signed short int x) { cerr << x; }
void print(unsigned short int x) { cerr << x; }
void print(signed int x) { cerr << x; }
void print(unsigned int x) { cerr << x; }
void print(signed long int x) { cerr << x; }
void print(unsigned long int x) { cerr << x; }
void print(signed long long int x) { cerr << x; }
void print(unsigned long long int x) { cerr << x; }
void print(float x) { cerr << x; }
void print(double x) { cerr << x; }
void print(long double x) { cerr << x; }
void print(string x) { cerr << '\"' << x << '\"'; }
template <size_t N>
void print(bitset<N> x) { cerr << x; }
void print(vector<bool> v)
{ /* Overloaded this because stl optimizes vector<bool> by using
_Bit_reference instead of bool to conserve space. */
int f = 0;
cerr << '{';
for (auto && i : v)
cerr << (f++ ? "," : "") << (i ? "T" : "F");
cerr << "}";
}
/* Templates Declarations to support nested datatypes */
template <typename T>
void print(T &&x);
template <typename T>
void print(vector<vector<T>> mat);
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M]);
template <typename F, typename S>
void print(pair<F, S> x);
template <typename T, size_t N>
struct Tuple;
template <typename T>
struct Tuple<T, 1>;
template <typename... Args>
void print(tuple<Args...> t);
template <typename... T>
void print(priority_queue<T...> pq);
template <typename T>
void print(stack<T> st);
template <typename T>
void print(queue<T> q);
/* Template Datatypes Definitions */
template <typename T>
void print(T &&x)
{
/* This works for every container that supports range-based loop
i.e. vector, set, map, oset, omap, dequeue */
int f = 0;
cerr << '{';
for (auto && i : x)
cerr << (f++ ? "," : ""), print(i);
cerr << "}";
}
template <typename T>
void print(vector<vector<T>> mat)
{
int f = 0;
cerr << "\n~~~~~\n";
for (auto && i : mat)
{
cerr << setw(2) << left << f++, print(i), cerr << "\n";
}
cerr << "~~~~~\n";
}
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M])
{
int f = 0;
cerr << "\n~~~~~\n";
for (auto && i : mat)
{
cerr << setw(2) << left << f++, print(i), cerr << "\n";
}
cerr << "~~~~~\n";
}
template <typename F, typename S>
void print(pair<F, S> x)
{
cerr << '(';
print(x.first);
cerr << ',';
print(x.second);
cerr << ')';
}
template <typename T, size_t N>
struct Tuple
{
static void printTuple(T t)
{
Tuple < T, N - 1 >::printTuple(t);
cerr << ",", print(get < N - 1 > (t));
}
};
template <typename T>
struct Tuple<T, 1>
{
static void printTuple(T t) { print(get<0>(t)); }
};
template <typename... Args>
void print(tuple<Args...> t)
{
cerr << "(";
Tuple<decltype(t), sizeof...(Args)>::printTuple(t);
cerr << ")";
}
template <typename... T>
void print(priority_queue<T...> pq)
{
int f = 0;
cerr << '{';
while (!pq.empty())
cerr << (f++ ? "," : ""), print(pq.top()), pq.pop();
cerr << "}";
}
template <typename T>
void print(stack<T> st)
{
int f = 0;
cerr << '{';
while (!st.empty())
cerr << (f++ ? "," : ""), print(st.top()), st.pop();
cerr << "}";
}
template <typename T>
void print(queue<T> q)
{
int f = 0;
cerr << '{';
while (!q.empty())
cerr << (f++ ? "," : ""), print(q.front()), q.pop();
cerr << "}";
}
/* Printer functions */
void printer(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail)
{
/* Using && to capture both lvalues and rvalues */
int i = 0;
for (size_t bracket = 0; names[i] != '\0' and (names[i] != ',' or bracket != 0); i++)
if (names[i] == '(' or names[i] == '<' or names[i] == '{')
bracket++;
else if (names[i] == ')' or names[i] == '>' or names[i] == '}')
bracket--;
cerr.write(names, i) << " = ";
print(head);
if (sizeof...(tail))
cerr << " ||", printer(names + i + 1, tail...);
else
cerr << "]\n";
}
/* PrinterArr */
void printerArr(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printerArr(const char *names, T arr[], size_t N, V... tail)
{
size_t ind = 0;
for (; names[ind] and names[ind] != ','; ind++)
cerr << names[ind];
for (ind++; names[ind] and names[ind] != ','; ind++)
;
cerr << " = {";
for (size_t i = 0; i < N; i++)
cerr << (i ? "," : ""), print(arr[i]);
cerr << "}";
if (sizeof...(tail))
cerr << " ||", printerArr(names + ind + 1, tail...);
else
cerr << "]\n";
}
}
#ifdef LOCAL
#define debug(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printer(#__VA_ARGS__, __VA_ARGS__);
#define debugArr(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printerArr(#__VA_ARGS__, __VA_ARGS__);
#else
#define debug(...)
#define debugArr(...)
#endif
#endif
mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
return uniform_int_distribution<ll>(a, b)(mt_rng);
}
/*--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e17;
const int d4i[4] = { -1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = { -1, -1, 0, 1, 1, 1, 0, -1}, d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int kni[8] = { +2, +2, -2, -2, 1, -1, 1, -1}, knj[8] = {1, -1, 1, -1, 2, 2, -2, -2};
ll n, m, q, x, y, z , h;
const ll tas = 1e6 + 10;
ll a[tas];
vector<ll> b[tas];
ll l[tas];
ll r[tas];
ll k[tas];
string s, t;
// vector<ll> grid[tas];
// vector<pii> edges[tas];
string ans = "";
class segtree{
public:
ll seg[4*tas];
ll lazy[4*tas];
void build(ll i,ll l,ll r){
// debug(i,l,r)
// debug(i,seg[])
if(l==r){
seg[i] = a[l];
lazy[i]=0;
return;
}
ll mid = (l+r)/2;
build(2*i+1,l,mid);
// cout<<
build(2*i+2,mid+1,r);
seg[i] = max(seg[2*i+1],seg[2*i+2]);
}
void push(ll i,ll l,ll r){
ll mid = (l+r)/2;
seg[2*i+1]+=lazy[i];
lazy[2*i+1]+=lazy[i];
seg[2*i+2]+=lazy[i];
lazy[2*i+2]+=lazy[i];
lazy[i]=0;
}
void update(ll i,ll l,ll r,ll tl,ll tr,ll tval){
if(tl<=l&&r<=tr){
seg[i] +=tval;
lazy[i]=tval;
return;
}
else if(tl > r||l>tr) return;
push(i,l,r);
ll mid = (l+r)/2;
update(2*i+1,l,mid,tl,tr,tval);
update(2*i+2,mid+1,r,tl,tr,tval);
seg[i] = max(seg[2*i+1],seg[2*i+2]);
}
ll query(ll i,ll l,ll r,ll tl,ll tr){
if(tl<=l&&r<=tr){
// seg[i] +=tval*(r-l+1);
// lazy[i]=tval;
// debug(seg[i],i,l,r)
return seg[i];
}
else if(tl > r||l>tr) return 0;
push(i,l,r);
ll mid = (l+r)/2;
return max(query(2*i+1,l,mid,tl,tr),
query(2*i+2,mid+1,r,tl,tr));
}
};
segtree seg;
void solve(ll tc = 0) {
cin >> n>>m;
FOR(n) cin >> a[i];
seg.build(0,0,n);
vector<pii> vec;
vec.pb(mp(n,INF));
FOR(m){
cin >> x>>y>>z;
x--,y--;
l[i]=x;
r[i]=y;
k[i]=z;
b[x].pb(i);
ans+='0';
}
// debug(seg.query(0,0,n,0,n))
FOR(i,n-1,-1,-1){
while(vec.back().s < a[i]){
pii t1 = vec.back();
vec.pop_back();
x = vec.back().f;
seg.update(0,0,n,t1.f,t1.f,INF);
if(t1.f+1<=x-1)
seg.update(0,0,n,t1.f+1,x-1,-t1.s);
// seg.update(0,0,n,)
}
// debug(i,vec)
if(i+1<=vec.back().f-1)
seg.update(0,0,n,i+1,vec.back().f-1,a[i]);
seg.update(0,0,n,i,i,-INF);
vec.pb(mp(i,a[i]));
for(auto cur:b[i]){
ll tans = seg.query(0,0,n,l[cur],r[cur]);
// debug(tans)
if(k[cur] < tans) ans[cur] = '0';
else ans[cur]='1';
}
}
FOR(sz(ans))cout<<ans[i]<<endl;
}
int main() {
fastio
#ifdef LOCAL
// auto begin = std::chrono::high_resolution_clock::now();
if(freopen("input.txt", "r", stdin));
if(freopen("output.txt", "w", stdout));
if(freopen("error.txt", "w", stderr));
#endif
ll tc = 1;
//cin >> tc;
for (ll t = 0; t < tc; t++) solve(t);
#ifdef LOCAL
// auto end = std::chrono::high_resolution_clock::now();
// auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
// cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
#endif
}
