#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
    ll ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
//head
#define N 110000
int n,m,K,Q,q1[N],q2[N],c1[N],c2[N];
int lowbit(int x){
    return x&(-x);
}
void add(int *c,int x,int n){
    for(;x<=n;x+=lowbit(x)){
        c[x]++;
    //    cout<<x<<endl;
        }
}
int sum(int *c,int x){
    int ans=0;
    for(;x;x-=lowbit(x))ans+=c[x];
    return ans;
}
int main(){
    int T=read();
    while(T--){
        n=read();m=read();K=read();Q=read();
        rep(i,1,n)c1[i]=0;
        rep(i,1,m)c2[i]=0;
        rep(i,1,K)q1[i]=read(),q2[i]=read();
        sort(q1+1,q1+K+1);
        sort(q2+1,q2+K+1);
        rep(i,1,K){
            if(i==1 || q1[i]!=q1[i-1])add(c1,q1[i],n);
            if(i==1 || q2[i]!=q2[i-1])add(c2,q2[i],m);
            }
        while(Q--){
            int t1=read(),t3=read(),t2=read(),t4=read();
            int s1=sum(c1,t2)-sum(c1,t1-1),s2=sum(c2,t4)-sum(c2,t3-1);
            if(s1!=t2-t1+1 && s2!=t4-t3+1)printf("No\n");
            else printf("Yes\n");
        }
    }
    return 0;
}