#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int n, m;
int p, q;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
vector<vector<int> > a
n+=10, m+=10;
int d[n][m];
memset(d, 0, sizeof d);
cin>>p;
int x1, x2, y1, y2;
while(p--)
{
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
d[x1][y1]++;
d[x2+1][y2+1]++;
d[x2+1][y1]--;
d[x1][y2+1]--;
}
for(int i=1;i<n;i++)
for(int j=1;j<m;j++)
d[i][j]+=d[i-1][j]+d[i][j-1]-d[i-1][j-1];
for(int i=1;i<n;i++)
for(int j=1;j<m;j++)
d[i][j]=min(1, d[i][j]);
for(int i=1;i<n;i++)
for(int j=1;j<m;j++)
d[i][j]+=d[i-1][j]+d[i][j-1]-d[i-1][j-1];
cin>>q;
while(q--)
{
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
int s=d[x2][y2]+d[x1-1][y1-1]-d[x1-1][y2]-d[x2][y1-1];
int t=(x2-x1+1)*(y2-y1+1);
if(s>=t) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
return 0;
}