#include <cstdio>
#include <utility>
#include <algorithm>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;

int N, M, Q;
int L[202020], R[202020];
int mn[808080], mx[808080];

void init(int id, int s, int e){
    if (s == e){
        mn[id] = L[s];
        mx[id] = R[s];
        return;
    }
    int m=s+e>>1;
    init(id*2, s, m), init(id*2+1, m+1, e);
    mn[id] = min(mn[id*2], mn[id*2+1]);
    mx[id] = max(mx[id*2], mx[id*2+1]);
}

pii rmq(int id, int s, int e, int ts, int te){
    if (e < ts || te < s) return pii(N, 0);
    if (ts <= s && e <= te) return pii(mn[id], mx[id]);
    int m=s+e>>1;
    pii r1 = rmq(id*2, s, m, ts, te);
    pii r2 = rmq(id*2+1, m+1, e, ts, te);
    return pii(min(r1.fi, r2.fi), max(r1.se, r2.se));
}

int main(){
    scanf("%d %d", &N, &M);
    for (int i=1; i<N; i++) L[i] = R[i] = i;
    for (int i=1; i<=M; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        if (x < y) R[x-1] = max(R[x-1], y-1);
        else L[x] = min(L[x], y);
    }
    for (int lv=1; lv<=18; lv++){
        init(1, 1, N-1);
        for (int i=1; i<N; i++){
            pii r = rmq(1, 1, N-1, L[i], R[i]);
            L[i] = r.fi, R[i] = r.se;
        }
    }
    init(1, 1, N-1);
    scanf("%d", &Q);
    while (Q--){
        int l1, r1, l2, r2;
        scanf("%d %d %d %d", &l1, &r1, &l2, &r2);
        pii r = rmq(1, 1, N-1, l1, r1-1);
        puts((r.fi <= l2 && r2 <= r.se+1) ? "YES" : "NO");
    }
    return 0;
}