// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

// @category セグメント木 (Segment Tree)
// @title セグメント木 (Segment Tree)
// 抽象 SegmentTree (0-indexed・一点更新・区間取得)
template <typename MonoidType>
struct SegmentTree {
    using Function = function< MonoidType(MonoidType, MonoidType) >;

    // node, identity element
    int n;
    vector<MonoidType> node;
    MonoidType E0;

    // update / combine function
    Function upd_f, cmb_f;

    void build(int m, vector<MonoidType> v = vector<MonoidType>()) {
        if(v != vector<MonoidType>()) m = v.size();
        n = 1; while(n < m) n *= 2;

        node = vector<MonoidType>(2*n-1, E0);
        if(v != vector<MonoidType>()) {
            for(int i=0; i<m; i++) {
                node[n-1+i] = v[i];
            }
            for(int i=n-2; i>=0; i--) {
                node[i] = cmb_f(node[2*i+1], node[2*i+2]);
            }
        }
    }

    // initialize
    SegmentTree() {}
    SegmentTree(int n_, MonoidType E0_,
                Function upd_f_, Function cmb_f_,
                vector<MonoidType> v = vector<MonoidType>()) :
        E0(E0_), upd_f(upd_f_), cmb_f(cmb_f_) {
        build(n_, v);
    }

    // update k-th element (applied value: x)
    void update(int k, MonoidType x) {
        k += n - 1;
        node[k] = upd_f(node[k], x);
        while(k > 0) {
            k = (k - 1) / 2;
            node[k] = cmb_f(node[2*k+1], node[2*k+2]);
        }
    }

    // range query for [a, b)
    // 非再帰のアイデア: http://d.hatena.ne.jp/komiyam/20131202/1385992406
    MonoidType query(int a, int b) {
        MonoidType vl = E0, vr = E0;
        for(int l=a+n, r=b+n; l<r; l>>=1, r>>=1) {
            if(l & 1) vl = cmb_f(vl, node[(l++)-1]);
            if(r & 1) vr = cmb_f(node[(--r)-1], vr);
        }
        return cmb_f(vl, vr);
    }
};

using Rect = tuple<int, int, int, int, int>;

int main() {
    int N, M; scanf("%d%d", &N, &M);
    vector<Rect> A(N), B(M);
    for(int i=0; i<N; i++) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        A[i] = make_tuple(a, b, c, d, i);
    }
    for(int i=0; i<M; i++) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        B[i] = make_tuple(a, b, c, d, i);
    }

    SegmentTree<int> seg(100010, -INF,
                         [](int a, int b) { return b; },
                         [](int a, int b) { return max(a, b); });
    
    vector< multiset<int> > cnt(100010);
    vector<int> ans(M);
    auto solve = [&](auto&& f, int L, int R,
                     const vector<Rect> &AR, const vector<Rect>&BR) -> void {
        int mid = (L + R) / 2;
        vector<Rect> NLA, NLB, NRA, NRB;
        for(auto e : AR) {
            int a, b, c, d, k; tie(a, b, c, d, k) = e;
            if(L <= a and a < mid) NLA.emplace_back(e);
            if(mid <= a and a < R) NRA.emplace_back(e);
        }
        for(auto e : BR) {
            int a, b, c, d, k; tie(a, b, c, d, k) = e;
            if(L <= a and a < mid) NLB.emplace_back(e);
            if(mid <= a and a < R) NRB.emplace_back(e);
        }

        // priority: del, query, add
        vector< tuple<int, int, int> > queries;
        for(auto e : NLB) {
            int a, b, c, d, k; tie(a, b, c, d, k) = e;
            queries.emplace_back(b, 1, k);
        }
        for(auto e : NRA) {
            int a, b, c, d, k; tie(a, b, c, d, k) = e;
            queries.emplace_back(a, 2, k);
            queries.emplace_back(b, 0, k);
        }

        sort(queries.begin(), queries.end());
        for(auto q : queries) {
            int v, t, k; tie(v, t, k) = q;
            if(t == 0) {
                int a, b, c, d; tie(a, b, c, d, std::ignore) = A[k];
                cnt[c].erase(cnt[c].find(d));
                int val = (cnt[c].size() ? *(--cnt[c].end()) : -INF);
                seg.update(c, val);
            }
            if(t == 1) {
                int a, b, c, d; tie(a, b, c, d, std::ignore) = B[k];
                ans[k] |= (seg.query(c+1, d) > d);
            }
            if(t == 2) {
                int a, b, c, d; tie(a, b, c, d, std::ignore) = A[k];
                cnt[c].emplace(d);
                int val = *(--cnt[c].end());
                seg.update(c, val);
            }
        }

        if(R - L > 1) {
            f(f, L, mid, NLA, NLB);
            f(f, mid, R, NRA, NRB);
        }
    };

    solve(solve, 0, 100010, A, B);
    for(int i=0; i<M; i++) printf("%s\n", ans[i] ? "Yes" : "No");
    return 0;
}



Measured memory_bytes: 111872