#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int N = 1e5 + 5;
const int K = 40;

int n, q;
int L[N * K], R[N * K], cnt = 1;
set<pair<int, int> > s[N * K];

void add(int x, pair<int, int> val, int v = 1, int tl = 1, int tr = 1000000000){
	s[v].insert(val);
	if(tl == tr)
		return;
	int tm = (tl + tr) >> 1;
	if(x <= tm){
		if(!L[v]) L[v] = ++cnt;
		add(x, val, L[v], tl, tm);
	}else{
		if(!R[v]) R[v] = ++cnt;
		add(x, val, R[v], tm + 1, tr);
	}
}

vector<int> vals;
void get(int x, int y, int l, int r, int v = 1, int tl = 1, int tr = 1000000000){
	if(tl > tr || tr < x || tl > y || sz(vals) >= 50)
		return;
	
	if(x <= tl && tr <= y){
		auto it = s[v].lower_bound({l, 0});
		while(it != s[v].end() && it -> f <= r && sz(vals) < 50){
			vals.push_back(it->s);
			it++;
		}
		return;
	}
	int tm = (tl + tr) >> 1;
	if(L[v]){
		get(x, y, l, r, L[v], tl, tm);
	}
	if(R[v]){
		get(x, y, l, r, R[v], tm + 1, tr);
	}
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		int x, y, h;
		cin >> x >> y >> h;
		add(x, {y, h});
	}
	
	while(q--){
		int x1, y1, x2, y2;
		vals.clear();
		cin >> x1 >> y1 >> x2 >> y2;
		get(x1, x2, y1, y2);
		
		if(sz(vals) >= 50){
			cout << "1\n";
			continue;
		}
		
		sort(all(vals), greater<int>());
		bool found = 0;
		for(int i = 0; i + 2 < sz(vals); i++){
			if(vals[i] < vals[i + 1] + vals[i + 2]){
				found = 1;
				break;
			}
		}
		
		cout << found << "\n";
	}
	return 0;
}