#include <bits/stdc++.h> using namespace std; #define print(l) for(auto i:l) cout<<i<<" ";cout<<endl; #define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i]; #define int long long #define pb push_back #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define all(l) l.begin(),l.end() #define pii pair<int,int> #define fi first #define se second const int M = 1e9+7; const int inf = 1e18; int bp(int x, int y, int p){ int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int MI(int n, int p){ return bp(n, p - 2, p); } int mul(int x,int y, int p){ return x * 1ull * y % p; } int di(int x,int y, int p){ return mul(x, MI(y, p), p); } int n , m , k , q; int r,c; void solve(int testcase_number){ cin>>r>>c>>n; map<int,vector<int>>X; for(int i = 0;i<n;i++){ int x,y; cin>>x>>y; X[x].pb(y); } for(int i = 0;i<=n;i++){ sort(all(X[i])); } int qq; cin>>qq; while(qq--){ int x,y,x1,y1; cin>>x>>y>>x1>>y1; int f = 0; for(int i = x;i<x1;i++){ auto it = lower_bound(all(X[i]),y); // print(X[i]); // cout<<*it<<endl; if(it == X[i].end()){ f = 1; // cout<<y<<" "; cout<<"No"<<endl; break; } // cout<<y<<" "; y = *it; if(y>y1){ f = 1; // cout<<y<<" "; cout<<"No"<<endl; break; } } if(!f){ cout<<"Yes"<<endl; } } } signed main(){ ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE cin.tie(0), cout.tie(0); cout << fixed<<setprecision(9); int t = 1; // cin>>t; for(int i = 1;i<=t;i++){ solve(i); } }