#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

int g[3000][3000] = {};

signed main(void) {
    int n;
    cin >> n;
    int l,r;
    cin >> l >> r;
    l += 600;
    r += 600;
    g[2999][l]--;
    g[2999][r+1]++;
    rep(i,n){
        int xl,yu,xr,yd;
        cin >> xl >> yu >> xr >> yd;
        xl += 600;
        yu += 600;
        xr += 600;
        yd += 600;
        xr++;
        yd++;
        g[yu][xl] += i+1;
        g[yd][xl] -= i+1;
        g[yu][xr] -= i+1;
        g[yd][xr] += i+1;
    }
    rep(i,3000)rep(j,3000-1)g[i][j+1] += g[i][j];
    rep(j,3000)rep(i,3000-1)g[i+1][j] += g[i][j];
    vi ans(n,0);
    for(int i = 2998; i >= 0; i--)for(int j = 2999; j >= 0; j--)if(g[i+1][j] == -1){
        if(g[i][j]){
            ans[g[i][j]-1]++;
        }else{
            g[i][j] = -1;
        }
    }
    rep(i,n){
        if(ans[i])cout << 1 << endl;
        else cout << 0 << endl;
    }
}