// #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_policy.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 r,c,n; cin>>r>>c>>n; map<int,vec<int>>d; set<int>val1; for(int i=0;i<n;i++){ int a,b; cin>>a>>b; d[a].append(b); val1.insert(a); } for(auto a:val1) sort(all(d[a])); int q; cin>>q; for(int i=0;i<q;i++){ int a,b,a1,b1; cin>>a>>b>>a1>>b1; while(a!=a1){ auto p=lower_bound(all(d[a]),b); if(p==d[a].end()) break; a++; b=*p; } if(a<a1 or b>b1) cout<<"No\n"; else cout<<"Yes\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(); }