#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  map<P,int> mp;
  bool bl[200];
  fill(bl,bl+200,false);
  int xl,yu,xr,yd;
  int N,LB,RB;
  cin >> N >> LB >> RB;
  REP(i,N){
    cin >> xl>>yu>>xr>>yd;
    int j=yd;
    for(int d=xl;d<=xr;d++)
      mp[P(d,j)] = i+1;
  }
  for(int i=LB;i<=RB;i++){
    for(int y=1680;y>=1;y--){
      if(mp[P(i,y)] != 0){
        bl[mp[P(i,y)]] = true;
        break;
      }
    }
  }
  REP(i,N){
    if(bl[i+1])
      cout << 1 << endl;
    else
      cout << 0 << endl;
  }
  return 0;
}