#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
    int N,xLB,xRB;
    int m,k;
    cin >> N >> xLB >> xRB;
    vector<int> XL(N),YU(N),XR(N),YD(N);
    vector<bool> F(N,false);
    for(int i = 0; i < N; i++)
    {
        cin >> XL[i] >> YU[i] >> XR[i] >> YD[i];
    }
    for(int i = xLB; i <= xRB; i++)
    {
        m = -501;
        k = -1;
        for(int j = 0; j < N; j++)
        {
            if (XL[j] <= i && XR[j] >= i && m < YD[j]) {
                m = YD[j];
                k = j;
            }
        }
        if (k >= 0) {
            F[k] = true;
        }
    }
    for(int i = 0; i < N; i++)
    {
        if (F[i]) {
            cout << 1 << endl;
        }
        else {
            cout << 0 << endl;
        }
    }
    
    
    return 0;
}