#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int sz=201,INF=1000000000;
using namespace std;
ll n,m,l,p,num1,num2,Num1,Num2,Num3,Num4;
vector<vector<bool>>isSeen(sz,vector<bool>(sz));
set<pair<ll,ll>>nums;
void dfs(ll num1,ll num2)
{
if(num1>=1 && num1<=n && num2>=1 && num2<=m && !isSeen[num1][num2])
{
isSeen[num1][num2]=true;
if(num1!=Num3 || num2!=Num4)
{
if(nums.find({num1,num2})!=nums.end())
{
dfs(num1+1,num2),dfs(num1,num2+1);
}
else
{
dfs(num1,num2+1);
}
}
}
}
void solve()
{
cin>>n>>m>>l;
for(int i=0;i<l;i++)
{
cin>>num1>>num2;
nums.in({num1,num2});
}
cin>>p;
for(int i=0;i<p;i++)
{
for(int j=0;j<sz;j++)
{
fill(all(isSeen[j]),false);
}
cin>>Num1>>Num2>>Num3>>Num4;
dfs(Num1,Num2);
if(isSeen[Num3][Num4])
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
}
}
int main()
{
fastIO;
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
