/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < ll, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
const ll mod = (ll) 998244353;
//const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 2e5 + 5;
vector < ii > v[N];
ll par[N][20];
ll x[N], y[N];
void solve(){
ll r, c; cin >> r >> c;
ll n , t; cin >> n;
vector < ll > idx;
y[0] = c + 1;
for(ll i = 1; i <= n; i++){
cin >> x[i] >> y[i];
idx.pb(x[i]);
}
sort(idx.begin(), idx.end());
idx.erase(unique(idx.begin(), idx.end()), idx.end());
for(ll i = 1; i <= n; i++){
ll k = lower_bound(idx.begin(), idx.end(), x[i]) - idx.begin();
v[k].pb({y[i], i});
}
for(ll i = 0; i < idx.size(); i++){
sort(v[i].begin(), v[i].end());
}
mem(par, 0);
for(ll i = 1; i <= n; i++){
ll k = lower_bound(idx.begin(), idx.end(), x[i] + 1) - idx.begin();
if(k == idx.size() || idx[k] != x[i] + 1){
par[i][0] = 0;
}else{
if(v[k].back().ff < y[i]) par[i][0] = 0;
else{
auto [d , j] = *lower_bound(v[k].begin(), v[k].end(), make_pair(y[i], 0LL) );
par[i][0] = j;
}
}
}
for(ll j = 1; j < 20; j++){
for(ll i = 1; i <= n; i++){
par[i][j] = par[par[i][j - 1]][j - 1];
}
}
cin >> t;
while(t--){
ll a, b, c, d;
cin >> a >> b >> c >> d;
if(a > c || b > d){
cout << "No\n";
continue;
}
if(a == c){
cout << "Yes\n";
continue;
}
ll k = lower_bound(idx.begin(), idx.end(), a) - idx.begin();
if(k == idx.size() || idx[k] != a || v[k].back().ff < b){
cout << "No\n";
continue;
}
auto [A , cur] = *lower_bound(v[k].begin(), v[k].end(), make_pair(b, 0LL));
ll tot = c - a - 1;
for(ll i = 19; i >= 0; i--){
if((1LL << i) & tot){
cur = par[cur][i];
}
}
if(y[cur] <= d){
cout << "Yes\n";
}else{
cout << "No\n";
}
}
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre(N);
ll T = 1, CT = 0; //cin >> T;
while(T--){
// cout << "Case #" << ++CT <<": " ;
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}
