#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA
void solve() {
int R, C, N; cin >> R >> C >> N;
map<int, set<int>> green;
for (int i = 0, r, c; i < N; ++i) cin >> r >> c, green[r].ee(c);
int T; cin >> T;
for (int q = 1; q <= T; ++q) {
int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;
if (sx > ex or (sx == ex and sy > ey)) {cout << "No" << "\n"; goto meow;}
if (sx == ex) {cout << "Yes" << "\n"; goto meow;}
for (int r = sx, c = sy; r < ex; ++r) {
if (!green.count(r)) {cout << "No" << "\n"; goto meow;}
auto it = green[r].lower_bound(c);
if (it == end(green[r])) {cout << "No" << "\n"; goto meow;}
c = *it;
if (c > ey) {cout << "No" << "\n"; goto meow;}
}
cout << "Yes" << "\n";
meow:;
}
}
int32_t main() {
fastIO();
int t = 1; // cin >> t;
for (int _ = 1; _ <= t; ++_) {
solve();
}
return 0;
}
#else
#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define int int64_t
// #define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;
// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())
#ifdef local
#define fastIO() void()
#define debug(...) \
fprintf(stderr, "%sAt [%s], line %d: (%s) = ", "\u001b[33m", __FUNCTION__, __LINE__, #__VA_ARGS__), \
_do(__VA_ARGS__), fprintf(stderr, "%s", "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}
#endif
