// eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee //
// 271828___182845__904523__53602__ //
// 87___47____13______52____66__24_ //
// 97___75____72______47____09___36 //
// 999595_____74______96____69___67 //
// 62___77____24______07____66__30_ //
// 35___35____47______59____45713__ //
// eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee //
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;
int n, m, s = 1;
vector<int> seg, v, qryseg;
vector<vector<int>> mst;
vector<int> merge(vector<int>& a, vector<int>& b) {
vector<int> m;
int i = 0, j = 0;
while (i < a.size() && j < b.size()) {
if (a[i] < b[j]) m.push_back(a[i++]);
else m.push_back(b[j++]);
}
while (i < a.size()) m.push_back(a[i++]);
while (j < b.size()) m.push_back(b[j++]);
return m;
}
void build_mst(int l, int r, int u) {
if (l == r) {
if (l < n) mst[u].push_back(v[l]);
return;
}
int m = (l + r) / 2;
build_mst(l, m, 2 * u + 1), build_mst(m + 1, r, 2 * u + 2);
mst[u] = merge(mst[2 * u + 1], mst[2 * u + 2]);
}
int get_mst(int &l, int &r, int lx, int rx, int &k, int u) {
if (lx >= l && rx <= r) {
int id = lower_bound(mst[u].begin(), mst[u].end(), k) - mst[u].begin() - 1;
if (id == -1) return -1;
return mst[u][id];
}
if (lx > r || rx < l) return -1;
int m = (lx + rx) / 2;
return max(get_mst(l, r, lx, m, k, 2 * u + 1), get_mst(l, r, m + 1, rx, k, 2 * u + 2));
}
void build(int l, int r, int u) {
if (l == r) {
if (l < n) seg[u] = v[l];
return;
}
int m = (l + r) / 2;
build(l, m, 2 * u + 1), build(m + 1, r, 2 * u + 2);
seg[u] = max(seg[2 * u + 1], seg[2 * u + 2]);
}
int get(int &l, int &r, int lx, int rx, int u) {
if (lx >= l && rx <= r) return seg[u];
if (lx > r || rx < l) return -1;
int m = (lx + rx) / 2;
return max(get(l, r, lx, m, 2 * u + 1), get(l, r, m + 1, rx, 2 * u + 2));
}
void build_qry(int l, int r, int u) {
if (l == r) {
qryseg[u] = 0;
return;
}
int m = (l + r) / 2;
build_qry(l, m, 2 * u + 1), build_qry(m + 1, r, 2 * u + 2);
qryseg[u] = max(qryseg[2 * u + 1], qryseg[2 * u + 2]);
int M = m + 1;
int a = get(l, m, 0, s - 1, 0), b = get_mst(M, r, 0, s - 1, a, 0);
if (b != -1) qryseg[u] = max(qryseg[u], a + b);
}
int get_qry(int &l, int &r, int lx, int rx, int u) {
if (lx >= l && rx <= r) return qryseg[u];
if (lx > r || rx < l) return -1;
int m = (lx + rx) / 2;
int L = max(lx, l), R = min(rx, r);
int M = m + 1;
int a = get(L, m, 0, s - 1, 0), b = get_mst(M, R, 0, s - 1, a, 0);
if (b == -1) return max(get_qry(l, r, lx, m, 2 * u + 1), get_qry(l, r, m + 1, rx, 2 * u + 2));
return max({ get_qry(l, r, lx, m, 2 * u + 1), get_qry(l, r, m + 1, rx, 2 * u + 2), a + b });
}
void solve() {
cin >> n >> m;
v = vector<int>(n);
while (s < n) s <<= 1;
qryseg = seg = vector<int>(2 * s, -1);
mst = vector<vector<int>>(2 * s);
// int mn = 2e9;
for (int i = 0; i < n; ++i) cin >> v[i]/*, mn = min(mn, v[i])*/;
// vector<int> ids;
// for (int i = 1; i < n; ++i) {
// if (v[i] < v[i - 1]) ids.push_back(i);
// }
// ids.push_back(n);
build(0, s - 1, 0), build_mst(0, s - 1, 0), build_qry(0, s - 1, 0);
while (m--) {
int l, r, w; cin >> l >> r >> w;
// if (w < mn) {
// int id = upper_bound(ids.begin(), ids.end(), --l) - ids.begin();
// id = ids[id] - 1;
// if (id < --r) cout << "0\n";
// else cout << "1\n";
// }
cout << (get_qry(--l, --r, 0, s - 1, 0) <= w) << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
//int _; cin >> _; while (_--)
solve();
}
