#include <bits/stdc++.h>

using namespace std;

typedef int ll;

inline ll read()

{

    ll s=; bool f=; char ch=' ';

    while(!isdigit(ch))    {f|=(ch=='-'); ch=getchar();}

    while(isdigit(ch)) {s=(s<<)+(s<<)+(ch^); ch=getchar();}

    return (f)?(-s):(s);

}

#define R(x) x=read()

inline void write(ll x)

{

    if(x<) {putchar('-'); x=-x;}

    if(x<) {putchar(x+''); return;}

    write(x/); putchar((x%)+'');

}

#define W(x) write(x),putchar(' ')

#define Wl(x) write(x),putchar('\n')

const int B=,N=;

int n,m,k,Q;

bool ans[N];

struct point

{

    int x,y;

    inline bool operator<(const point &tmp)const

    {

        return y<tmp.y;

    }

}sb[N];

struct xunwen

{

    int x1,y1,x2,y2,id;

    inline bool operator<(const xunwen &tmp)const

    {

        return y2<tmp.y2;

    }

}xw[N];

struct node{int mn;}T[B<<];

#define c1 (x<<1)

#define c2 (x<<1|1)

inline void build(int x,int l,int r)

{

    T[x].mn=; if(l==r) return;

    int mid=(l+r)>>;

    build(c1,l,mid); build(c2,mid+,r);

    T[x].mn=min(T[c1].mn,T[c2].mn);

}

inline void chag(int x,int l,int r,int pos,int val)

{

    if(l==r)

    {

        T[x].mn=max(T[x].mn,val); return;

    }

    int mid=(l+r)>>;

    if(pos<=mid) chag(c1,l,mid,pos,val);

    else chag(c2,mid+,r,pos,val);

    T[x].mn=min(T[c1].mn,T[c2].mn);

}

inline int que(int x,int l,int r,int ql,int qr)

{

    if(l==ql&&r==qr) return T[x].mn;

    int mid=(l+r)>>;

    if(qr<=mid) return que(c1,l,mid,ql,qr);

    else if(ql>mid) return que(c2,mid+,r,ql,qr);

    else return min(que(c1,l,mid,ql,mid),que(c2,mid+,r,mid+,qr));

}

inline void Solve()

{

    int i,j=;

    build(,,n);

    sort(sb+,sb+k+);

    sort(xw+,xw+Q+);

    for(i=;i<=Q;i++)

    {

        while(j<=k&&sb[j].y<=xw[i].y2)

        {

            chag(,,n,sb[j].x,sb[j].y); j++;

        }

        int oo=que(,,n,xw[i].x1,xw[i].x2);

        if(oo>=xw[i].y1) ans[xw[i].id]=;

    }

}

int main()

{

    freopen("codeforces524E_data.in","r",stdin);

    int i;

    memset(ans,,sizeof ans);

    R(n); R(m); R(k); R(Q);

    for(i=;i<=k;i++) R(sb[i].x),R(sb[i].y);

    for(i=;i<=Q;i++)

    {

        R(xw[i].x1); R(xw[i].y1); R(xw[i].x2); R(xw[i].y2); xw[i].id=i;

    }

    Solve();

    swap(n,m);

    for(i=;i<=k;i++) swap(sb[i].x,sb[i].y);

    for(i=;i<=Q;i++)

    {

        swap(xw[i].x1,xw[i].y1); swap(xw[i].x2,xw[i].y2);

    }

    Solve();

    for(i=;i<=Q;i++)

    {

        if(ans[i]) puts("YES"); else puts("NO");

    }

    return ;

}