#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e3+10;
const int mod=1e9+7;
int r,c,n;
vector<int>g[maxn];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
/*cin>>r>>c>>n;
int t;
map<int,set<int>>m;
vector<pair<int,int>>v;
map<pair<int,int>,int>nval;
map<int,set<int>>GinR;
for(int i=1;i<=n;i++)
{
int ci,cj;///node ...
cin>>ci>>cj;
v.push_back({ci,cj});
m[ci].insert(cj);
nval[{ci,cj}]=i;
GinR[ci].insert(cj);
}
map<int,set<int>>sB;
int cnt=n+1;
for(int i=0;i<n;i++)
{
int a=v[i].first;
int b=v[i].seoncd;
int node1=nval[{a,b}];
if(nval[{a+1,b}]==0)
{
int node2=cnt;
sB[a+1].insert(b);
g[node1].push_back(node2);
cnt++;
}
if(m[a+1].size()>0)
{
if(m[a+1].lower_bound(b)!=m[a+1].end())
{
int pos=*m[a+1].lower_bound(b);
int node3=nval[{a+1,pos}];
g[node1].push_back(node3);
}
}
}
cin>>t;
for(int idx=0;idx<t;idx++)
{
int si,sj,ei,ej;
cin>>si>>sj>>ei>>ej;
if(si==ei && sj<=ej)
{
cout<<"YES"<<endl;
continue;
}
if(GinR[si].size()>0)
{
if(GinR[si].lower_bound(sj)!=GinR[si].end())
{
int pos=*GinR[si].lower_bound(sj);///first T to the right of (si,sj) that is green
}
}
cout<<"NO"<<endl;
}*/
return 0;
}
