// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_pntlicy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;
int iter=1,itera=1;
void solve(){
int n;
cin>>n>>n>>n;
set<pii>pnt;
map<pii,bool>gr;
map<pii,set<vec<int>>>d;
map<int,set<int>>grpo;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
pnt.insert(pai(a,b));
pnt.insert(pai(a+1,b));
gr[pai(a,b)]=1;
grpo[a].insert(b);
}
int t;
cin>>t;
vec<bool>ans(t,0);
for(int i=0;i<t;i++){
int a,b,a1,b1;
cin>>a>>b>>a1>>b1;
if(a>a1)
continue;
if(a==a1){
if(b<=b1) ans[i]=1;
continue;
}
pnt.insert(pai(a,b));
d[pai(a,b)].insert({a1,b1,i});
}
for(auto [x,y]:pnt){
pii a=pai(x,y);
while(d[a].size() and (*d[a].begin())[0]==x){
vec<int>b=*(d[a].begin());
if(b[1]>=y)
ans[b[2]]=1;
d[a].erase(b);
}
if(gr[pai(x,y)]){
pii b=pai(x+1,y);
if(d[a].size()>d[b].size()) swap(d[a],d[b]);
for(auto pa:d[a])
d[b].insert(pa);
d[a].clear();
continue;
}
set<int>&s=grpo[x];
if(s.lower_bound(y)==s.end())
continue;
int y1=*(s.lower_bound(y));
pii b=pai(x,y1);
if(d[a].size()>d[b].size()) swap(d[a],d[b]);
for(auto pa:d[a])
d[b].insert(pa);
d[a].clear();
}
for(auto i:ans){
if(i) cout<<"Yes\n";
else cout<<"No\n";
}
}
signed main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(20);
// cin>>itera;
for(iter=1;iter<=itera;iter++) solve();
}
