#include<bits/stdc++.h>

using std::cin;
using std::cout;
const int N = 100005;
int n, q;
struct pt { int x, y, h; } a[N];
struct pr { int y, h; };
std::vector<int> o;
std::vector<pr> sgt[N << 2];
int s[N << 2];
void ins(int p, pr x, int cur = 1, int l = 1, int r = n) {
	sgt[cur].push_back(x);
	if(l == r) {
		return ;
	}
	int mid = (l + r) >> 1;
	if(p <= mid) {
		ins(p, x, cur << 1, l, mid);
	} else {
		ins(p, x, cur << 1 | 1, mid + 1, r);
	}
}
std::vector<int> v;

void solve(int ql, int qr, int L, int R, int cur = 1, int l = 1, int r = n) {
	if(v.size() >= 50) return ;
	if(ql <= l && r <= qr) {
		auto & x = sgt[cur];
		auto cmp = [](auto x, auto y) { return x.y < y.y; };
		if(!s[cur]) {
			s[cur] = 1;
			sort(x.begin(), x.end(), cmp);
		}
		auto iter = lower_bound(x.begin(), x.end(), pr{L, 0}, cmp);
		for(;iter != x.end() && iter -> y <= R;++iter) {
			if(v.size() >= 50) return ;
			v.push_back(iter -> h);
		}
		return ;
	}
	int mid = (l + r) >> 1;
	if(ql <= mid) solve(ql, qr, L, R, cur << 1, l, mid);
	if(mid < qr) solve(ql, qr, L, R, cur << 1 | 1, mid + 1, r);
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> q;
	for(int i = 1;i <= n;++i) {
		cin >> a[i].x >> a[i].y >> a[i].h;
		o.push_back(a[i].x);
	}
	sort(o.begin(), o.end());
	for(int i = 1;i <= n;++i) {
		a[i].x = lower_bound(o.begin(), o.end(), a[i].x) - o.begin() + 1;
		ins(a[i].x, pr{a[i].y, a[i].h});
	}
	for(int i = 1;i <= q;++i) {
		int lx, ly, rx, ry;
		cin >> lx >> ly >> rx >> ry;
		lx = lower_bound(o.begin(), o.end(), lx) - o.begin() + 1;
		rx = lower_bound(o.begin(), o.end(), rx + 1) - o.begin();
		v.clear();
		if(lx <= rx) {
			solve(lx, rx, ly, ry);
			if(v.size() >= 50) {
				cout << 1 << '\n';
			} else {
				sort(v.begin(), v.end());
				int ok = 0;
				for(int i = 2;i < (int) v.size();++i) {
					ok = ok || v[i] < v[i - 1] + v[i - 2];
				}
				cout << ok << '\n';
			}
		} else {
			cout << 0 << '\n';
		}
	}
}