#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define smn(a, b) a = min(a, b)
#define all(x) x.begin(), x.end()


const int SZ = 1e9 + 5;
template <class T, T (*op)(T, T), T (*e)()> struct seg1d {
    T val = e(); seg1d<T, op, e>* c[2];
    seg1d() { c[0] = c[1] = NULL; }
    void update(int pos, T v, int L = 0, int R = SZ-1) {
        if (L == pos && R == pos) { val = v; return; }
        int M = (L + R) / 2;
        if (pos <= M) {
            if (!c[0]) {
                c[0] = new seg1d();
            }
            c[0]->update(pos, v, L, M);
        } else {
            if (!c[1]) {
                c[1] = new seg1d();
            }
            c[1]->update(pos, v, M + 1, R);
        }
        val = e();
        if (c[0]) val = op(val, c[0]->val);
        if (c[1]) val = op(val, c[1]->val);
    }

    T query(int lo, int hi, int L = 0, int R = SZ-1) {
        if (hi < L || R < lo) return e();
        if (lo <= L && R <= hi) return val;
        int M = (L + R) / 2;
        T res = e();
        if (c[0]) {
            res = op(res, c[0]->query(lo, hi, L, M));
        }
        if (c[1]) {
            res = op(res, c[1]->query(lo, hi, M + 1, R));
        }
        return res;
    }
};

template <class T, T (*op)(T, T), T (*e)()> struct seg2d {
    seg1d<T, op, e> val; seg2d<T, op, e>* c[2]; 
    seg2d() { c[0] = c[1] = NULL; }
    void update(int posX, int posY, T v, int L = 0, int R = SZ - 1) {
        if (L == posX && R == posX) {
            val.update(posY, v);
            return;
        }
        int M = (L + R) / 2;
        if (posX <= M) {
            if (!c[0]) c[0] = new seg2d();
            c[0]->update(posX, posY, v, L, M);
        } else {
            if (!c[1]) c[1] = new seg2d();
            c[1]->update(posX, posY, v, M + 1, R);
        }
        T res = e();
        if (c[0]) res = op(res, c[0]->val.query(posY, posY + 1));
        if (c[1]) res = op(res, c[1]->val.query(posY, posY + 1));
        val.update(posY, res);
    }

    T query(int loX, int hiX, int loY, int hiY, int L = 0, int R = SZ - 1) {
        if (hiX < L || R < loX) { return e(); }
        if (loX <= L && R <= hiX) { return val.query(loY, hiY); }
        int M = (L + R) / 2;
        T res = e();
        if (c[0]) res = op(res, c[0]->query(loX, hiX, loY, hiY, L, M));
        if (c[1]) res = op(res, c[1]->query(loX, hiX, loY, hiY, M + 1, R));
        return res;
    } 
};

int op1(int a, int b) {
    return a + b;
}

int e1() {
    return 0;
}

vector<int> op2(vector<int> a, vector<int> b) {
    if (a.size() + b.size() >= 100) {
        return {}; // destruct it when large enough, not needed
    }
    if (a.size() > b.size()) {
        swap(a, b);
    }
    for (auto& c : a) {
        b.push_back(c);
    }
    return b;
}

vector<int> e2() {
    return {};
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q; cin >> n >> q;

    seg2d<int, op1, e1> trees;
    seg2d<vector<int>, op2, e2> heights;
    for (int i = 0; i < n; i++) {
        int x, y, w;
        cin >> x >> y >> w;
        trees.update(x, y, w);
        heights.update(x, y, {w});
    }

    for (int i = 0; i < q; i++) {
        int loX, loY, hiX, hiY;
        cin >> loX >> loY >> hiX >> hiY;
        if (trees.query(loX, hiX, loY, hiY) >= 50) {
            cout << "1\n";
            continue;
        }
        vector<int> qq = heights.query(loX, hiX, loY, hiY);
        sort(all(qq));
        if (qq.size() < 3) {
            cout << "0\n";
            continue;
        }
        for (int i = 0; i < (int)qq.size() - 2; i++) {
            if (qq[i] + qq[i + 1] > qq[i + 2]) {
                cout << "1\n";
                goto win;
            }
        }
        cout << "0\n";

        win:
        int y = 1;
    }
    return 0;
}