#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector< vector <int> > vvi;
typedef pair<int, int> pii;
typedef pair < pair < int, int >, int > piii;
typedef pair < pair <int, int > , pair <int, int> > piiii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
 
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define RFOR(i,a,b) for(int i = a-1; i >= b; i --)
#define all(a) a.begin(), a.end()
#define endl '\n';
#define sz(x) (int)(x).size()
 
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
 
template <typename T>
void pr(vector<T> &v) {
    FOR(i, 0, sz(v)) cout << v[i] << " ";
    cout << endl;
}
template <typename T>
void pr(vector<vector<T> > &v) {
    FOR(i, 0, sz(v)) { pr(v[i]); }
}
template <typename T>
void re(T &x) {
    cin >> x;
}
template <typename T>
void re(vector<T> &a) {
    FOR(i, 0, sz(a)) re(a[i]);
}
template <class Arg, class... Args>
void re(Arg &first, Args &... rest) {
    re(first);
    re(rest...);
}
template <typename T>
void pr(T x) {
    cout << x << endl;
}
template <class Arg, class... Args>
void pr(const Arg &first, const Args &... rest) {
    cout << first << " ";
    pr(rest...);
    cout << endl;
}
void ps() { cout << endl; }
template<class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
    cout << t; if (sizeof...(ts)) cout << " "; ps(ts...);
}
 
const ll MOD  =  998244353;
#define inf 1e18;
#define INF INT_MAX

long double PI = 4*atan(1);
long double eps = 1e-12;

int n,q;
vi xvals;
vector<piii> ts;
vector<pii> st[400100] = {};
int yl, yh;
vi res;

void insert(int p, int l, int r, int x, int y, int h) {
    if(l == r) {
        st[p].pb({y, h});
        //cout << p << " " << st[p].size() << endl;
        return;
    }
    int m = (l + r)/2;
    st[p].pb({y, h});
    if(x <= m) {
        insert(2*p, l, m, x, y, h);
    } else {
        insert(2*p+1, m+1, r, x, y, h);
    }

} 


void query(int p, int l, int r, int ql, int qr) {
    if(qr < l || r < ql) return;

    if(ql <= l && r <= qr) {
      //  cout << "HI" << " " << l << " " << r << endl;
        int lo = lower_bound(st[p].begin(), st[p].end(), (pii) {yl, -1}) - st[p].begin();
        for(int i = lo; i < st[p].size(); i++) {
            if(st[p][i].ff > yh) return;
            res.pb(st[p][i].ss);
            if(res.size() >= 60) return;
        }
        return;
    }

    int m = (l + r)/2;
    query(2*p, l, m, ql, qr);
    if(res.size() >= 60) return;
    query(2*p+1, m+1, r, ql, qr);
    return;
}

int main() {
    //auto start = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);cin.tie(0);
    // ofstream cout("disrupt.out");
    // ifstream cin("disrupt.in");
    #ifdef DEBUG
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif 
    
    cin >> n >> q;
    ts.resize(n);
    FOR(i,0,n) {
        int x,y,h; cin >> x >> y >> h;
        xvals.pb(x);
        ts[i] = {{x,y}, h};
    }
    sort(all(xvals));

    xvals.resize(unique(all(xvals)) - xvals.begin());

    FOR(i,0,n) {
        int xc = lower_bound(all(xvals), ts[i].ff.ff) - xvals.begin();
       // cout << xc << endl;
        insert(1, 0, 100000, xc, ts[i].ff.ss, ts[i].ss);
    }


    FOR(i,0,400100) sort(all(st[i]));

    // for(auto v : st[1]) {
    //     cout << v.ff << ", " << v.ss << endl;
    // }

    
    FOR(i,0,q) {
        res.clear();
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        yl = y1; yh = y2;
        int xl = lower_bound(all(xvals), x1) - xvals.begin();
        int xr = lower_bound(all(xvals), x2) - xvals.begin();
  //      cout << xl << " " << xr << endl;
        query(1, 0, 100000, xl, xr);
        

        if(res.size() >= 60) {
            cout << 1 << endl;
            continue;
        }
        if(res.size() < 3) {
            cout << 0 << endl;
            continue;
        }
        sort(all(res));
     //   pr(res);
        bool good = false;
        FOR(i,0,res.size() - 2) {
            if(res[i] + res[i+1] > res[i+2]) good =true;
        }
        cout << good << endl;
    //    cout << "----" << endl;
    }
    


    // auto stop = chrono::high_resolution_clock::now();
    // auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    // cout << duration.count() << endl;
    //cin.close();
    //cout.close();
}