#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
void program();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 3e5;
const int N = (1<<20);
int r,c,n,t;
int x[MX], y[MX], nxt[MX][20];
int sx[MX], sy[MX], ex[MX], ey[MX], ans[MX];
map<int,int> mp;
void program() {
IN(r,c,n);
RE1(i,n) IN(y[i],x[i]);
IN(t);
RE1(i,t) IN(sy[i],sx[i],ey[i],ex[i]);
viii trampolines;
RE1(i,n) trampolines.pb({x[i],y[i],i});
sort(all(trampolines),greater<iii>());
int ct=0;
vii queries;
RE1(i,t) queries.pb({sx[i],i});
sort(all(queries),greater<ii>());
RE(i,t) {
int q = queries[i].se;
if(sx[q] > ex[q] || sy[q] > ey[q]) {
ans[q] = 0;
continue;
}
if(sy[q] == ey[q]) {
ans[q] = 1;
continue;
}
while(ct != n) {
int _, tramp;
tie(_,_,tramp) = trampolines[ct];
if(x[tramp] < sx[q]) break;
mp[y[tramp]] = tramp;
nxt[tramp][0] = mp[y[tramp]+1];
REP(i,1,20) nxt[tramp][i] = nxt[nxt[tramp][i-1]][i-1];
ct++;
}
int res = mp[sy[q]];
int change = ey[q] - sy[q] - 1;
RE(i,20) if(change&(1<<i)) res = nxt[res][i];
if(res == 0) {
ans[q] = 0;
} else {
ans[q] = x[res] <= ex[q];
}
}
RE1(i,t) OUTL(ans[i] ? "Yes" : "No");
}
