#include <bits/stdc++.h>
using namespace std;

int root(vector<int>& UF,int x){
  if (UF[x]==-1) return x;
  return UF[x] = root(UF,UF[x]);
}
#define f(x,y) ((x*w)+y)

int main(){
  int n,h,w; cin >> n >> h >> w; h += 2,w += 2;
  vector<set<int>> A(h); vector B(h,vector<int>(w,1));
  for (int i(0);i < h;++i) for (int k(0);k < w;++k) A[i].emplace(k);
  multiset<tuple<int,int,int>,greater<tuple<int,int,int>>> que;
  auto g = [&](int t,int a,int b,int c,int d) -> void {
    if (B[c][d]) que.emplace(t,f(a,b),f(c,d));
  };
  vector<int> C(n);
  for (int i(0),s(h*w);i < n;++i){
    int a,b,c,d; cin >> a >> b >> c >> d;
    for (int k(a);k <= b;++k) for (auto it = A[k].lower_bound(c);it!=A[k].end();it=A[k].erase(it)){
      if (*it>d) break;
      int j = *it; B[k][j] = 0,--s;
      g(i,k,j,k-1,j),g(i,k,j,k+1,j),g(i,k,j,k,j-1),g(i,k,j,k,j+1);
    }
    C[i] = s;
  }
  for (int i(0);i < h;++i) for (int k(1);k < w;++k) if (B[i][k]&&B[i][k-1]) g(n,i,k,i,k-1);
  for (int i(1);i < h;++i) for (int k(0);k < w;++k) if (B[i][k]&&B[i-1][k]) g(n,i,k,i-1,k);
  vector<int> R(n),UF(h*w,-1),SZ(h*w,1);
  for (int i(n-1);i > -1;--i){
    while(!que.empty()&&get<0>(*que.begin())>i){
      auto [a,b,c] = *que.begin(); que.erase(que.begin());
      if (root(UF,b)!=root(UF,c)) SZ[root(UF,c)] += SZ[root(UF,b)],UF[root(UF,b)] = root(UF,c);
    }
    R[i] = (SZ[root(UF,0)]!=C[i]);
  }
  for (int r:R) cout << (r?"Yes":"No") << endl;
}