#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define in insert
#define pb push_back
ll xstart,xend,ystart,yend;
vector<vector<bool>>graph;
vector<vector<bool>>used;
bool ans=0;
ll R,C,N;
void dfs(ll x,ll y){
if(x>R || y>C || ans || used[x][y]){
return;
}
used[x][y]=1;
if(x==xend && y==yend){
ans=1;
return;
}
if(graph[x][y]){
dfs(x+1,y);
}
dfs(x,y+1);
}
void solve(){
cin>>R>>C>>N;
graph.resize(R+1);
used.resize(R+1);
for(int i=1;i<=R;i++){
graph[i].resize(C+1,0);
used[i].resize(C+1,0);
}
ll u,v;
for(int i=0;i<N;i++){
cin>>u>>v;
graph[u][v]=1;
}
ll q;
cin>>q;
while(q--){
cin>>xstart>>ystart>>xend>>yend;
ans=0;
dfs(xstart,ystart);
if(ans){
cout<<"YES\n";
}
else{
cout<<"NO\n";
}
}
}
int main(){
solve();
return 0;
}
