#include <bits/stdc++.h>
using namespace std;
const int mxN = 3e5 + 5;

vector<int> b[mxN], e[mxN];
int er[mxN];
set<int> seg[4 * mxN];
vector<pair<int, int>> pt[mxN];
vector<int> rem_stk;
vector<int> tri[mxN];

void ins(int id, int le, int ri, int i, int l, int r){
	if(le >= ri) return;
	if(l <= le && r >= ri){
		seg[id].insert(i);
		return;
	}
	if(r <= le || l >= ri) return;
	int m = (le + ri) / 2;
	ins(id << 1, le, m, i, l, r);
	ins(id << 1 | 1, m, ri, i, l, r);
}

void ins(int i, int l, int r){
	ins(1, 0, mxN - 2, i, l, r);
}

void era(int id, int le, int ri, int i, int l, int r){
	if(le >= ri) return;
	if(l <= le && r >= ri){
		auto it = seg[id].find(i);
		seg[id].erase(it);
		return;
	}
	if(r <= le || l >= ri) return;
	int m = (le + ri) / 2;
	era(id << 1, le, m, i, l, r);
	era(id << 1 | 1, m, ri, i, l, r);
}

void era(int i, int l, int r){
	era(1, 0, mxN - 2, i, l, r);
}

void go(int id, int le, int ri, int pos, int h){
	if(le >= ri) return;
	for(int x : seg[id]) if(!er[x]){
		tri[x].push_back(h);
		if((int)tri[x].size() > 70){
			er[x] = 1;
			rem_stk.push_back(x);	
		}
	}
	if(le + 1 == ri) return;
	int m = (le + ri) / 2;
	if(pos < m) go(id << 1, le, m, pos, h);
	else go(id << 1 | 1, m, ri, pos, h);
}

void go(int p, int h){
	go(1, 0, mxN - 2, p, h);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	vector<array<int, 3>> pts(n);
	vector<int> x, y;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < 3; j++) cin >> pts[i][j];
		x.push_back(pts[i][0]);
		y.push_back(pts[i][1]);
	}
	vector<array<int, 4>> qry(q);
	for(int i = 0; i < q; i++){
		for(int j = 0; j < 4; j++) cin >> qry[i][j];
		x.push_back(qry[i][0]);
		x.push_back(qry[i][2]);
		y.push_back(qry[i][1]);
		y.push_back(qry[i][3]);
	}
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	x.resize(unique(x.begin(), x.end()) - x.begin());
	y.resize(unique(y.begin(), y.end()) - y.begin());
	for(int i = 0; i < n; i++){
		pts[i][0] = lower_bound(x.begin(), x.end(), pts[i][0]) - x.begin();
		pts[i][1] = lower_bound(y.begin(), y.end(), pts[i][1]) - y.begin();
		pt[pts[i][1]].push_back({pts[i][0], pts[i][2]});
	}
	for(int i = 0; i < q; i++){
		qry[i][0] = lower_bound(x.begin(), x.end(), qry[i][0]) - x.begin();
		qry[i][1] = lower_bound(y.begin(), y.end(), qry[i][1]) - y.begin();
		qry[i][2] = lower_bound(x.begin(), x.end(), qry[i][2]) - x.begin();
		qry[i][3] = lower_bound(y.begin(), y.end(), qry[i][3]) - y.begin();
		b[qry[i][1]].push_back(i);
		e[qry[i][3]].push_back(i);
	}
	for(int j = 0; j < (int)(y.size()); j++){
		for(int ind : b[j]) ins(ind, qry[ind][0], qry[ind][2] + 1);
		for(pair<int, int> v : pt[j]){
			go(v.first, v.second);
			while(!rem_stk.empty()){
				int va = rem_stk.back();
				era(va, qry[va][0], qry[va][1] + 1);
				rem_stk.pop_back();
			}
		}
		for(int ind : e[j]) if(!er[ind]){
			er[ind] = 1;
			era(ind, qry[ind][0], qry[ind][2] + 1);
		}
	}
	for(int i = 0; i < q; i++){
		if((int)tri[i].size() > 70){
			cout << "1\n";
			continue;
		}
		sort(tri[i].begin(), tri[i].end());
		bool ok = 1;
		for(int j = 0; j < (int)(tri[i].size()) - 2; j++){
			if(tri[i][j] + tri[i][j + 1] > tri[i][j + 2]){
				cout << "1\n"; 
				ok = 0;
				break;
			}
		}
		if(ok) cout << "0\n";
	}
	return 0;
}