#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const int inf=1e9;

int N, xLB, xRB;
int XL[200], YU[200], XR[200], YD[200];
int front[1300],no[1300];
int ans[200];
int main(){
    cin>>N>>xLB>>xRB;
    REP(i,0,1300){
        front[i]=-inf;
    }
    REP(i,0,N){
        cin>>XL[i]>>YU[i]>>XR[i]>>YD[i];
        REP(j,max(xLB,XL[i]),min(xRB,XR[i])+1){
            if(front[j]<YD[i]){
                front[j]=YD[i];
                no[j]=i;
            }
        }
    }
    REP(i,xLB,xRB+1){
        ans[no[i]]=1;
    }
    REP(i,0,N){
        p(ans[i]);
    }
    return 0;
}