//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,Q,tt[100009],rt[100009],t[109],as[109],ak[109],qd,kq,ls[4000009],rs[4000009],seg[4000009],kd;
struct n_t{
	int x,y,h;
} a[100009];
struct m_t{
	int x,h;
};
inline bool cmp(n_t m,n_t n) {return m.x<n.x;}
inline bool cmpp(m_t m,m_t n) {return m.x<n.x;}
std::vector<m_t> p[100009];
#define md ((l+r)>>1)
void up(int n,int& nn,int l,int r,int p) {
	nn=++kd;
	seg[nn]=seg[n]+1;
	if(l==r) return;
	if(p<=md) {
		up(ls[n],ls[nn],l,md,p);
		rs[nn]=rs[n];
	} else {
		up(rs[n],rs[nn],md+1,r,p);
		ls[nn]=ls[n];
	}
}
int q(int r1,int r2,int l,int r,int L,int R) {
	if(r<L||R<l) return 0;
	if(L<=l&&r<=R) return seg[r2]-seg[r1];
	return q(ls[r1],ls[r2],l,md,L,R)+q(rs[r1],rs[r2],md+1,r,L,R);
}
void q2(int r1,int r2,int l,int r,int L,int R) {
	if(seg[r1]==seg[r2]||r<L||R<l) return;
	if(l==r) {
		t[++kq]=l;
		return;
	}
	q2(ls[r1],ls[r2],l,md,L,R);q2(rs[r1],rs[r2],md+1,r,L,R);
}
#undef md
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	N=read();Q=read();
	for(int i=1;i<=N;i++) {
		a[i].x=read();
		a[i].y=read();
		a[i].h=read();
		tt[i]=a[i].y;
	}
	std::sort(a+1,a+N+1,cmp);
	for(int i=1;i<=N;i++) {
		up(rt[i-1],rt[i],1,1000000000,a[i].y); 
	}
	std::sort(tt+1,tt+N+1);
	int k=std::unique(tt+1,tt+N+1)-tt;
	for(int i=1;i<=N;i++) {
		int v=std::lower_bound(tt+1,tt+k+1,a[i].y)-tt-1;
		p[v].push_back((m_t){a[i].x,a[i].h});
	}
	for(int i=1;i<=k;i++) std::sort(p[i].begin(),p[i].end(),cmpp);
	while(Q--) {
		int xl=read(),yl=read(),xr=read(),yr=read();
		int l=0,r=N,md;
		while(l<r) {
			md=(l+r+1)>>1;
			if(a[md].x<xl) l=md;else r=md-1;
		}
		int l2=0,r2=N;
		while(l2<r2) {
			md=(l2+r2+1)>>1;
			if(a[md].x<=xr) l2=md;else r2=md-1;
		}
		if(q(rt[l],rt[l2],1,1000000000,yl,yr)>100) {
			we(0);
			continue;
		}  
		kq=0;
		q2(rt[l],rt[l2],1,1000000000,yl,yr);
		qd=0;
		for(int i=1;i<=kq;i++) {
			int v=std::lower_bound(tt+1,tt+k+1,t[i])-tt-1;
			int l=0,r=p[v].size()-1;
			while(l<r) {
				md=(l+r)>>1;
				if(p[v][md].x>=xl) r=md;else l=md+1;
			}
			while(l<p[v].size()&&p[v][l].x<=xr) {
				ak[++qd]=p[v][l].h;
				l++;
			}
		}
		std::sort(ak+1,ak+qd+1);
		bool zz=0;
		for(int i=1;i+2<=qd;i++) {
			if(ak[i]+ak[i+1]>ak[i+2]) zz=1;
		}
		we(zz);
	}
	pcc();
    return 0;
}