#include<bits/stdc++.h>

using namespace std;


int main() {
  int N, xLB, xRB;
  cin >> N >> xLB >> xRB;
  vector< tuple< int, int, int, int, int > > tt;
  for(int i = 0; i < N; i++) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    tt.emplace_back(b, a, c, d, i);
  }
  sort(tt.rbegin(), tt.rend());
  set< int > v;
  for(int i = xLB; i <= xRB; i++) {
    v.emplace(i);
  }
  int ret = 0;
  vector< int > beet(N);
  for(auto &t : tt) {
    int a, b, c, d, e;
    tie(b, a, c, d, e) = t;
    auto it = v.lower_bound(a);
    while(it != v.end() && *it <= c) {
      beet[e] = true;
      it = v.erase(it);
    }
  }
  for(int i = 0; i < N; i++) cout << beet[i] << endl;
}