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

#define YES(condition) if(condition) cout << "YES" << endl; else cout << "NO" << endl
#define Yes(condition) if(condition) cout << "Yes" << endl; else cout << "No" << endl
#define POSS(condition) if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl
#define Poss(condition) if(condition)cout << "Possible" << endl; else cout << "Impossible" << endl
#define First(condition) if(condition)cout << "First" << endl; else cout << "Second" << endl
#define negative(condition, num) if(condition)cout << -1 << endl; else cout << num << endl
long power(long base, long exponent, long mod){ if(exponent % 2){ return power(base, exponent - 1, mod) * base % mod; }else if(exponent){ long root_ans = power(base, exponent / 2, mod); return root_ans * root_ans % mod; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define division long(1e9 + 7)
#define all(x) (x).begin(), (x).end()

struct enemy{
    int L, U, R, D;
    
    bool operator >(const enemy& another) const{
        return D > another.D;
    }
};

int main(){
    int N, xL, xR;
    cin >> N >> xL >> xR;
    enemy enemies[N];
    for(int i = 0; i < N; i++){
        cin >> enemies[i].L >> enemies[i].U >> enemies[i].R >> enemies[i].D;
    }
    sort(enemies, enemies + N, greater<enemy>());
    vector<bool> if_out(N, false);
    for(int i = xL; i <= xR; i++){
        for(int j = 0; j < N; j++){
            if(enemies[j].L <= i && i < enemies[j].R){
                if_out[j] = true;
                break;
            }
        }
    }
    for(int i = 0; i < N; i++){
        cout << if_out[i] << endl;
    }
}