#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define endl '\n'
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define sz(x) (int)x.size()
#define int long long
#define float double
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define rep(i,a,b) for (ll i = a; i<b; i++)
#define repo(i,a,b) for (int i = a; i>=b; i--)
#define fi first
#define se second
//int decrow[4] = {-1,0,1,0};
//int deccol[4] = {0,1,0,-1};
//int dp[100001][100001];
//int arr[100001];
int dy[8] = {0, 0, 1, -1, 1, -1 , 1, -1};
int dx[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const int MAXN = 1e6;
const int MOD = 1e9+7;
const int INF = 1e18;
int n,c,r;
int total = 0;
int ans = 0;
vi v;
int largerThanX(set<int> &s, int x){
auto it = s.upper_bound(x);
if(it == s.end()) return -2; /// x is larger than everything
return *it;
}
gp_hash_table<int,set<int>> mp;
void solve(){
int t;
cin>>r>>c>>n;
for(int i = 0;i<n;i++){
int a,b;
cin>>a>>b;
mp[a-1].insert(b-1);
}
cin>>t;
while(t--){
int a,b,aa,bb;
cin>>a>>b>>aa>>bb;
a--,b--,aa--,bb--;
//only do on bb and b
int last = b;
int swi = 1;
if(aa<a || bb<b){
cout<<"No"<<endl;
continue;
}
for(int i = a;i<aa;i++){
int place = largerThanX(mp[i],last-1);
if(place == -2){
cout<<"No"<<endl;
swi = 0;
break;
}else{
if(place <= bb){
last = place;
}else{
swi = 0;
cout<<"No"<<endl;
break;
}
}
}
if(swi == 1){
cout<<"Yes"<<endl;
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q;
q =1;
while(q--){
solve();
}
return 0;
}
