#include<bits/stdc++.h>
#define x first
#define y second
#define eb emplace_back
#define pb push_back
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define ROF(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define sz(x) (int)(x).size()
#define make_unique(x) sort(all(x)), (x).erase(unique(all(x)), (x).end())

using namespace std;

typedef long long i64;
//typedef __int128 i128;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<i64> vl;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<i64,i64> pll;
typedef tuple<int,int,int> iii;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

int readInt() { int a; scanf("%d",&a); return a; }
i64 readLong() { i64 a; scanf("%lld",&a); return a; }
char readChar() { char a; scanf(" %c",&a); return a; }
double readDouble() { double a; scanf(" %lf",&a); return a; }
void readString(char *s) { scanf(" %s",s); }

const int mod = 998244353;
int add(int a, int b) { return ((a+=b)>=mod) ? a-mod:a; }
int mul(int a, int b) { return a*1ll*b%mod; }
int pw(int a, int b) {
	int ans = 1, res = a;
	for(int i = 1; i <= b; i*=2, res=mul(res,res)) {
		if(i&b) {
			ans = mul(ans, res);
		}
	}
	return ans;
}

const int N = 100005;
vector<iii> seg[4*N];
vector<iii> point;

void build(int l, int r, int now) {
	if(l == r) {
		seg[now].eb(get<1>(point[l]),get<0>(point[l]),get<2>(point[l]));
		return ;
	}

	int mid = (l+r)/2;
	build(l, mid, now*2);
	build(mid+1, r, now*2+1);

	// merge
	int a = 0, b = 0;
	vector<iii> &A = seg[now*2];
	vector<iii> &B = seg[now*2+1];
	while(a < sz(A) && b < sz(B)) {
		if(A[a] < B[b]) {
			seg[now].pb(A[a++]);
		} else {
			seg[now].pb(B[b++]);
		}
	}
	while(a < sz(A)) seg[now].pb(A[a++]);
	while(b < sz(B)) seg[now].pb(B[b++]);

	// print finalize
	/*
	printf("[x1 %d, x2 %d]: ",l,r);
	FOR(idx, 0, sz(seg[now])-1) {
		printf("(%d,%d,%d) ",get<0>(seg[now][idx]),get<1>(seg[now][idx]),get<2>(seg[now][idx]));
	}
	puts("");
	*/
}

vector<int> height;
void query(int l, int r, int now, int x1, int x2, int y1, int y2) {
	if(x2 < l || r < x1) return;
	if(x1 <= l && r <= x2) {

		/*
		printf("[x1 %d, x2 %d]: ",l,r);
		FOR(idx, 0, sz(seg[now])-1) {
			printf("(%d,%d,%d) ",get<0>(seg[now][idx]),get<1>(seg[now][idx]),get<2>(seg[now][idx]));
		}
		puts("");
		*/

		iii temp(y1,-1,-1);
		int idx = lower_bound(all(seg[now]), temp)-seg[now].begin();
		while(idx < sz(seg[now]) && get<0>(seg[now][idx]) <= y2) {
			
			//printf("====(%d,%d,%d)\n",get<1>(seg[now][idx]),get<0>(seg[now][idx]),get<2>(seg[now][idx]));

			height.pb(get<2>(seg[now][idx]));
			idx++;
			// kill condition
			if(sz(height) > 60) {
				return ;
			}
		}
		return ;
	}

	int mid = (l+r)/2;
	query(l, mid, now*2, x1, x2, y1, y2);
	if(sz(height) > 60) return;
	query(mid+1, r, now*2+1, x1, x2, y1, y2);
	if(sz(height) > 60) return;
}

vi value;

int main() {
	int n = readInt();
	int q = readInt();

	FOR(i, 1, n) {
		int x, y, h;
		x = readInt();
		y = readInt();
		h = readInt();
		point.eb(x,y,h);
		value.eb(x);
	}

	sort(all(point));
	sort(all(value));
	
	/*
	printf("x: ");
	for(int e : value) printf("%d ",e);
	puts("");
	*/

	build(0,n-1,1);

	while(q--) {
		int x1, y1, x2, y2;
		scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
		x1 = lower_bound(all(value),x1)-value.begin();
		x2 = upper_bound(all(value),x2)-value.begin()-1;
		//printf("get x1 = %d x2 = %d\n",x1,x2);

		height.clear();
		query(0,n-1,1,x1,x2,y1,y2);

		if(sz(height) > 60) {
			printf("1\n");
			continue;
		}
		if(sz(height) < 3) {
			printf("0\n");
			continue;
		}

		//puts("hi");
		sort(all(height));
		int good = 0;
		FOR(i,0,sz(height)-3) {
			if(height[i]+height[i+1] > height[i+2]) {
				good = 1;
				break;
			}
		}

		if(good) printf("1\n");
		else printf("0\n");
	}

	return 0;
}