#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,H,W;
set<int> S[1010];
int Y1[1010],Y2[1010],X1[1010],X2[1010];
template<int um> class UF {
	public:
	vector<int> par,rank,cnt,G[um];
	UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
	void reinit(int num=um) {int i; FOR(i,num) rank[i]=0,cnt[i]=1,par[i]=i;}
	int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
	int count(int x) { return cnt[operator[](x)];}
	int operator()(int x,int y) {
		if((x=operator[](x))==(y=operator[](y))) return x;
		cnt[y]=cnt[x]=cnt[x]+cnt[y];
		if(rank[x]>rank[y]) return par[x]=y;
		rank[x]+=rank[x]==rank[y]; return par[y]=x;
	}
};
UF<1010*1010> uf;

vector<pair<int,int>> V[1010];
int C[1010][1010];
int ret[1010];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>H>>W;
	H+=2,W+=2;
	FOR(y,H) FOR(x,W) S[y].insert(x);
	
	int NW=H*W;
	FOR(i,N) {
		cin>>Y1[i]>>Y2[i]>>X1[i]>>X2[i];
		for(y=Y1[i];y<=Y2[i];y++) {
			auto it=S[y].lower_bound(X1[i]);
			while(it!=S[y].end()&&*it<=X2[i]) {
				V[i].push_back({y,*it});
				C[y][*it]=1;
				NW--;
				it=S[y].erase(it);
			}
		}
	}
	FOR(y,H) FOR(x,W) {
		if(C[y][x]==0&&y&&C[y-1][x]==0) uf(y*1010+x,(y-1)*1010+x);
		if(C[y][x]==0&&x&&C[y][x-1]==0) uf(y*1010+x,(y-0)*1010+x-1);
	}
	for(i=N-1;i>=0;i--) {
		ret[i]=uf.count(0)==NW;
		FORR2(y,x,V[i]) {
			C[y][x]=0;
			NW++;
			if(C[y-1][x]==0) uf(y*1010+x,(y-1)*1010+x);
			if(C[y+1][x]==0) uf(y*1010+x,(y+1)*1010+x);
			if(C[y][x-1]==0) uf(y*1010+x,(y-0)*1010+x-1);
			if(C[y][x+1]==0) uf(y*1010+x,(y-0)*1010+x+1);
		}
	}
	FOR(i,N) {
		if(ret[i]) cout<<"No"<<endl;
		else cout<<"Yes"<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}