#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<31)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

int n, xlb, xrb, lx[205], rx[205], yu[205], yd[205]; 
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> n >> xlb >> xrb;
    rep(i, 0, n) cin >> lx[i] >> yu[i] >> rx[i] >> yd[i];
    vii ans(n);
    erep(i, xlb, xrb) {
        vector<Pii> a;
        rep(j, 0, n) {
            if (lx[j] <= i && i <= rx[j]) a.pb(mp(-yd[j], j));
        }
        sort(all(a));
        if (!a.empty()) ans[a[0].second] = 1;
    }
    rep(i, 0, n) {
        cout << ans[i] << endl;
    }
    return 0;
}