#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll N, LB, RB;
  cin >> N >> LB >> RB;
  vector<ll> XL(N), YU(N), XR(N), YD(N);
  vector< pair<int, int> > vp(N);
  vector<bool> used(1300, false);

  for(int i=0;i<N;i++) {
    cin >> XL[i] >> YU[i] >> XR[i] >> YD[i];
    vp[i] = make_pair(YD[i], i);
  }

  sort(vp.begin(), vp.end(), greater<pair<int, int> >());
  vector<int> ans(N);
  for(int i=0;i<N;i++) {
    int idx = vp[i].second;
    if(XL[idx] >= RB || XR[idx] <= LB) {
      ans[idx] = 0;
      continue;
    }

    bool flag = false;
    for(int x=max<ll>(0, XL[idx]);x<=min<ll>(XR[idx], RB);x++) {
      if(!used[x])
        flag = true;
      used[x] = true;
    }
    if(flag)
      ans[idx] = 1;
    else
      ans[idx] = 0;
  }
  for(int i=0;i<N;i++)
    cout << ans[i] << endl;


}