#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
ll readint(){
ll x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int r,c,n,q;
int x[200005],y[200005],nxt[200005][20];
map<int,set<pii>> v;
int main(){
r=readint(); c=readint(); n=readint();
for(int i=1;i<=n;i++){
x[i]=readint(); y[i]=readint();
v[x[i]].emplace(y[i],i);
}
for(int i=1;i<=n;i++){
auto it=v[x[i]+1].lower_bound(mp(y[i],-1));
if(it==v[x[i]+1].end()) nxt[i][0]=0;
else nxt[i][0]=it->se;
}
for(int j=1;j<20;j++){
for(int i=1;i<=n;i++){
nxt[i][j]=nxt[nxt[i][j-1]][j-1];
}
}
q=readint();
while(q--){
int x1=readint(),y1=readint(),x2=readint(),y2=readint();
if(x1>x2||y1>y2){
printf("No\n");
continue;
}
if(x1==x2){
printf("Yes\n");
continue;
}
auto it=v[x1].lower_bound(mp(y1,-1));
if(it==v[x1].end()){
printf("No\n");
continue;
}
int idx=it->se;
for(int i=19;i>=0;i--){
if(((x2-x1-1)>>i)&1) idx=nxt[idx][i];
}
if(idx!=0&&y[idx]<=y2) printf("Yes\n");
else printf("No\n");
}
return 0;
}
