#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define PPF pop_front
#define PPB pop_back
#define MA make_pair
#define ll long long
#define PA pair<int,int>
#define VE vector<int>
#define VP vector<PA>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
using namespace std;
//
const int INF=1e9+7;
const int mod=1e9+7;
//
//
struct poi{
  int X;int Y;int Z;
  bool operator<(const poi&R)const{
    return X==R.X ? Y==R.Y ? Z<R.Z : Y<R.Y : X<R.X;
  }
};
//
//
bool out[2000];
int main(){
	int N;
	int LB,RB;
	cin>>N;
	cin>>LB>>RB;
	VP V[2000];
	FOR(i,0,N){
		int XL,YU,XR,YD;
		cin>>XL>>YU>>XR>>YD;
		if(XL<0){
			XL=0;
		}
		if(YU<0){
			YU=0;
		}
		if(XR<0){
			XR=0;
		}
		if(YD<0){
			YD=0;
		}
		if(XL>1280){
			XL=1280;
		}
		if(YU>1680){
			YU=1680;
		}
		if(XR>1280){
			XR=1280;
		}
		if(YD>1680){
			YD=1680;
		}
		FOR(j,XL,XR+1){
			V[j].PB(MA(YD,i));
		}
	}
	FOR(i,0,2000){
		sort(V[i].rbegin(),V[i].rend());
	}
	FOR(i,0,2000){
		if(V[i].empty()){
			continue;
		}else{
			out[V[i][0].SE]=true;
		}
	}
	FOR(i,0,N){
		if(out[i]){
			cout<<1<<endl;
		}else{
			cout<<0<<endl;
		}
	}
	return 0;
}