codeforces524E

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{
    ll s=0; bool f=0; char ch=‘ ‘;
    while(!isdigit(ch))    {f|=(ch==‘-‘); ch=getchar();}
    while(isdigit(ch)) {s=(s<<3)+(s<<1)+(ch^48); ch=getchar();}
    return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{
    if(x<0) {putchar(‘-‘); x=-x;}
    if(x<10) {putchar(x+‘0‘); return;}
    write(x/10); putchar((x%10)+‘0‘);
}
#define W(x) write(x),putchar(‘ ‘)
#define Wl(x) write(x),putchar(‘\n‘)
const int B=100005,N=200005;
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<<2];
#define c1 (x<<1)
#define c2 (x<<1|1)
inline void build(int x,int l,int r)
{
    T[x].mn=0; if(l==r) return;
    int mid=(l+r)>>1;
    build(c1,l,mid); build(c2,mid+1,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)>>1;
    if(pos<=mid) chag(c1,l,mid,pos,val);
    else chag(c2,mid+1,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)>>1;
    if(qr<=mid) return que(c1,l,mid,ql,qr);
    else if(ql>mid) return que(c2,mid+1,r,ql,qr);
    else return min(que(c1,l,mid,ql,mid),que(c2,mid+1,r,mid+1,qr));
}
inline void Solve()
{
    int i,j=1;
    build(1,1,n);
    sort(sb+1,sb+k+1);
    sort(xw+1,xw+Q+1);
    for(i=1;i<=Q;i++)
    {
        while(j<=k&&sb[j].y<=xw[i].y2)
        {
            chag(1,1,n,sb[j].x,sb[j].y); j++;
        }
        int oo=que(1,1,n,xw[i].x1,xw[i].x2);
        if(oo>=xw[i].y1) ans[xw[i].id]=1;
    }
}
int main()
{
    freopen("codeforces524E_data.in","r",stdin);
    int i;
    memset(ans,0,sizeof ans);
    R(n); R(m); R(k); R(Q);
    for(i=1;i<=k;i++) R(sb[i].x),R(sb[i].y);
    for(i=1;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=1;i<=k;i++) swap(sb[i].x,sb[i].y);
    for(i=1;i<=Q;i++)
    {
        swap(xw[i].x1,xw[i].y1); swap(xw[i].x2,xw[i].y2);
    }
    Solve();
    for(i=1;i<=Q;i++)
    {
        if(ans[i]) puts("YES"); else puts("NO");
    }
    return 0;
}