#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define lft(x) x * 2
#define rgt(x) x * 2 + 1
#define tm hui_pizda
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz size()
#define cnt continue
#define m_p make_pair
#define fr(i, l, r) for(int i = l; i <= r; ++ i)
#define rf(i, r, l) for(int i = r; i >= l; -- i)
#pragma GCC optimize(-O3)
#pragma GCC optimize(Ofast)
#pragma GCC optimize("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using _set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <ll> vl;
typedef vector <pii> vpi;
typedef vector <pll> vpl;
mt19937_64 rnd(time(NULL));
const ll N = 1e6 + 10;
const ll mtrxN = 10;
const ll oo = 1e18 + 10;
//const ll oo = 228;
const ll B = 500;
const ll mod = 1e9 + 7;
struct mtrx{
ll m[mtrxN][mtrxN] = {};
};
mtrx mtrx_mult(mtrx a, mtrx b){
mtrx c;
fr(i, 0, mtrxN - 1){
fr(j, 0, mtrxN - 1){
ll sum = 0;
fr(x, 0, mtrxN - 1){
sum += a.m[i][x] * b.m[x][j];
sum %= mod;
}
c.m[i][j] = sum;
}
}
return c;
}
mtrx mtrx_pow(mtrx a, ll n){
mtrx res;
fr(i, 0, mtrxN - 1)fr(j, 0, mtrxN - 1)res.m[i][j] = a.m[i][j];
n --;
while(n){
if(n&1)res = mtrx_mult(res, a);
a = mtrx_mult(a, a);
n >>= 1;
}
return res;
}
ll _pow(ll a, ll n){
ll r = 1;
while(n){
if(n&1)r = r * a % mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
ll div(ll x, ll y, ll md){
return x * _pow(y, md - 2) % md;
}
ll a[1000001], p[1000001];
ll ans[5001][5001];
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
ll n, Q;
cin >> n >> Q;
fr(i, 1, n)cin >> a[i];
if(n <= 5000 && Q <= 5000){
fr(i, 1, n){
ll mx = -oo, mx_k = 0;
fr(j, i, n){
mx = max(mx, a[j]);
if(mx > a[j])mx_k = max(mx_k, a[j] + mx);
ans[i][j] = mx_k;
}
}
fr(e, 1, Q){
ll l, r, k;
cin >> l >> r >> k;
if(ans[l][r] <= k)cout << 1 << "\n";
else cout << 0 << "\n";
}
return 0;
}
fr(i, 1, n - 1){
p[i] = p[i - 1];
if(a[i] > a[i + 1])p[i] ++;
}
fr(e, 1, Q){
ll l, r, k;
cin >> l >> r;
//cin >> l >> r >> k;
if(l == r)cout << 1 << "\n";
else if(p[l - 1] == p[r - 1])cout << 1 << "\n";
else cout << 0 << "\n";
}
return 0;
}
/*
строки +
столбцы -
4 6
1 2 3 1
1 2
1 3
1 4
2 3
2 4
3 4
*/
