#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5 + 10, LOGN = log2(MAXN) + 1, inf = ~0U >> 2, INF = ~0U >> 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
	template <typename T> il bool read(T &x) {
		x = 0; bool f = false; char ch;
 		while (!isdigit(ch = getchar())) {
			f ^= !(ch ^ '-');
			if (ch == EOF) return false;
		}
		while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
		if (f) x = ~x + 1; return true;
	}
	il int read() {int x; read(x); return x;}

	template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}

	template <typename T> il void gmin(T &x, T y) {x = x < y ? x : y;}

 	template <typename T> il void gmax(T &x, T y) {x = x > y ? x : y;}

	template <typename T, typename ...L>
	il bool read(T &x, L &...y) {return read(x) && read(y...);}

	template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, q, flg; vector <int> b;
vector <pii> now, t[MAXN];

struct setr {
	vector <pii> val[MAXN << 2];
	
	il void build(int x, int l, int r) {
		rep1(i, l, r) for (auto v : t[i]) val[x].eb(v);
		sort(begin(val[x]), end(val[x]));
		if (l == r) return;
		int mid = l + r >> 1;
		build(ls(x), l, mid); build(rs(x), mid + 1, r);
	}
	
	il void query(int x, int l, int r, int ql, int qr, int yl, int yr) {
		if (l > qr || r < ql) return;
		if (flg) return;
		if (l >= ql && r <= qr) {
			auto itl = lower_bound(begin(val[x]), end(val[x]), mp(yl, -1)), itr = upper_bound(begin(val[x]), end(val[x]), mp(yr, inf));
			if (itr - itl + now.size() >= 50) now.clear(), flg = 1;
			else {
				for (auto it = itl; it != itr; ++it) now.eb(*it);
			} return;
		} int mid = l + r >> 1;
		query(ls(x), l, mid, ql, qr, yl, yr); query(rs(x), mid + 1, r, ql, qr, yl, yr); 
	} 
} T;

struct {
	int x, y, h;
	
	il void input() {
		read(x, y, h); b.eb(x);
	}
} a[MAXN];

int main() {
	read(n, q);
	rep1(i, 1, n) a[i].input();
	sort(begin(b), end(b)); int m = unique(begin(b), end(b)) - begin(b); b.resize(m);
	rep1(i, 1, n) t[lower_bound(begin(b), end(b), a[i].x) - begin(b) + 1].eb(a[i].y, a[i].h);
	T.build(1, 1, m); int x, y, xx, yy;
	while (q--) {
		read(x, y, xx, yy);
		x = lower_bound(begin(b), end(b), x) - begin(b) + 1; xx = upper_bound(begin(b), end(b), xx) - begin(b);
		flg = 0; now.clear(); T.query(1, 1, m, x, xx, y, yy);
		sort(begin(now), end(now), [&](const pii &x, const pii &y){return x.snd < y.snd;}); int len = now.size();
		rep1(i, 2, len - 1) flg |= now[i - 2].snd + now[i - 1].snd > now[i].snd;
		printf("%d\n", flg);
	}
	return 0;
}