#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 1e6+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, k, sz=1;
struct Node{
int L, R, ans;
};
Node t[N*2];
Node Merge(Node &l, Node &r){
Node res = {l.L, r.R, l.ans & r.ans};
if(l.R > r.L)res.ans = 0;
return res;
}
int get(int l, int r){
Node resl = {a[l],a[l], 1};
Node resr = {a[r],a[r], 1};
l++;r--;
for(l += sz, r += sz; l <= r; l>>=1,r>>=1){
if(l%2==1){
resl = Merge(resl, t[l++]);
}if(r%2==0){
resr = Merge(t[r--], resr);
}
}
Node res = Merge(resl, resr);
return res.ans;
}
void solve(int test_case){
int i, j, q;
cin >> n >> q;
while(sz<n)sz<<=1;
sz=n;
for(i=0;i<n;i++){
cin >> a[i];
t[i+sz] = {a[i], a[i], 1};
}
for(i=sz-1;i>0;i--)t[i] = Merge(t[i*2], t[i*2+1]);
while(q--){
int l, r;
cin >> l >> r >> k;
l--, r--;
if(get(l,r)){
cout << 1 << '\n';
}else {
cout << 0 << '\n';
}
}
return;
}
signed main(){
FASTIO;
#define MULTITEST 0
#if MULTITEST
int ___T;
cin >> ___T;
for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
solve(T_CASE);
#else
solve(1);
#endif
return 0;
}
