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

struct enemy { int xl, yu, xr, yd; };

int main() {
  int n, xlb, xrb;
  cin>>n>>xlb>>xrb;

  enemy es[n];
  pair<int, int> yds[n];
  for (int i=0; i<n; i++) {
    int xl, yu, xr, yd;
    cin>>xl>>yu>>xr>>yd;
    es[i] = {xl, yu, xr, yd};
    yds[i] = {yd, i};
  }
  sort(yds, yds + n);
  reverse(yds, yds + n);
  int beam[1281];
  for (int i=0; i<1281; i++) {
    if (i >= xlb && i<= xrb) {
      beam[i] = 1;
    } else {
      beam[i] = 0;
    }
  }
  int ans[n];
  for (int i=0; i<n; i++) ans[i] = 0;
  for (auto yd: yds) {
    enemy e = es[yd.second];
    for (int i=max(e.xl, 0); i<=min(e.xr, 1280); i++) {
      if (beam[i] == 1) {
        ans[yd.second] = 1;
        for (int j=i; j<=min(e.xr, 1280); j++) {
          beam[j] = 0;
        }
        break;
      }
    }
  }
  for (int i: ans) {
    cout<<i<<endl;
  }
}