#include <bits/stdc++.h>
using namespace std;

#define ii pair<int,int>
#define ff first
#define ss second

const int maxn = 3e5 + 10;
int ans[maxn], thres = 45, n, q, cnt = 0;
ii pre[maxn];

struct tree {
    int x, y, h;
} t[maxn];

struct queries {
    int x1, y1, x2, y2, id;
} qu[maxn];

struct sweep {
    int x, y, type, h;
} sw[maxn];

vector<int> cy, tmp, fen[maxn];
vector<ii> seg[4*maxn];

inline void upd(int pos, int val) {for (; pos<maxn; pos+=pos&-pos) fen[pos].push_back(val);}
inline int ask(int pos, int l, int r)
{
    int ans = 0;
    for (; pos; pos-=pos&-pos)
        ans += upper_bound(fen[pos].begin(), fen[pos].end(), r) - lower_bound(fen[pos].begin(), fen[pos].end(), l);
    return ans;
}
inline int ask(int lx, int rx, int l, int r) {return ask(rx, l, r) - ask(lx-1, l, r);}

void build(int id = 1, int l = 1, int r = cnt)
{
    if (l == r)
    {
        if (!sw[l].type) seg[id].push_back({sw[l].y, sw[l].h});
        return;
    }
    int m = (l+r)>>1;
    build(id<<1, l, m);
    build(id<<1|1, m+1, r);
    merge(seg[id<<1].begin(), seg[id<<1].end(), seg[id<<1|1].begin(), seg[id<<1|1].end(),
                    back_inserter(seg[id]));
}

void query(int id, int cl, int cr, int lx, int rx, int l, int r)
{
    if (cl > rx || cr < lx) return;
    if (cl >= lx && cr <= rx)
    {
        if (seg[id].empty()) return;
        ii temp = {l, 0};
        auto pos1 = lower_bound(seg[id].begin(), seg[id].end(), temp);
        temp = {r, 2e9};
        auto pos2 = upper_bound(seg[id].begin(), seg[id].end(), temp);
        while (pos1 != pos2) tmp.push_back(pos1->ss), pos1++;
        return;
    }
    int m = (cl + cr) >> 1;
    query(id<<1, cl, m, lx, rx, l, r);
    query(id<<1|1, m+1, cr, lx, rx, l, r);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    cin>>n>>q;
    for (int i=1; i<=n; i++)
    {
        cin>>t[i].x>>t[i].y>>t[i].h;
        cy.push_back(t[i].y);
    }
    for (int i=1; i<=q; i++)
    {
        cin>>qu[i].x1>>qu[i].y1>>qu[i].x2>>qu[i].y2;
        qu[i].id = i;
        cy.push_back(qu[i].y1);
        cy.push_back(qu[i].y2);
    }
    sort(cy.begin(), cy.end());
    cy.resize(unique(cy.begin(), cy.end()) - cy.begin());
    for (int i=1; i<=n; i++)
    {
        t[i].y = lower_bound(cy.begin(), cy.end(), t[i].y) - cy.begin() + 1;
        sw[++cnt] = {t[i].x, t[i].y, 0, t[i].h};
    }
    for (int i=1; i<=q; i++)
    {
        qu[i].y1 = lower_bound(cy.begin(), cy.end(), qu[i].y1) - cy.begin() + 1;
        qu[i].y2 = lower_bound(cy.begin(), cy.end(), qu[i].y2) - cy.begin() + 1;
        sw[++cnt] = {qu[i].x1, qu[i].y1, -i, 0};
        sw[++cnt] = {qu[i].x2, qu[i].y2, i, 0};
    }
    sort(sw+1, sw+cnt+1, [](sweep x, sweep y) {return (x.x != y.x ? x.x < y.x : x.type < y.type);});
//    for (int i=1; i<=cnt; i++) if (!sw[i].type) upd(i, sw[i].y);
//    for (int i=1; i<maxn; i++) sort(fen[i].begin(), fen[i].end());
    build();
    for (int i=1; i<=cnt; i++) if (sw[i].type)
    {
        if (sw[i].type < 0) pre[-sw[i].type] = {i, sw[i].y};
        else
        {
            int cnt_tree = ask(pre[sw[i].type].ff, i, pre[sw[i].type].ss, sw[i].y);
            if (cnt_tree >= thres) ans[sw[i].type] = 1;
            else
            {
                tmp.clear();
                query(1, 1, cnt, pre[sw[i].type].ff, i, pre[sw[i].type].ss, sw[i].y);
                sort(tmp.begin(), tmp.end());
                bool f = 0;
                if (tmp.size() >= 3)
                for (int i=0; i<tmp.size()-2; i++) if (tmp[i] + tmp[i+1] > tmp[i+2])
                {
                    f = 1;
                    break;
                }
                ans[sw[i].type] = f;
            }
        }
    }
    for (int i=1; i<=q; i++) cout<<ans[i]<<"\n";
}