#include <bits/stdc++.h>
using namespace std;
#define ll long long
static int field[1281][1681];
int main() {
  int n, xlb, xrb;
  cin >> n >> xlb >> xrb;
  for(int x=0; x<1281; x++) {
    for(int y=0; y<1681; y++) {
      field[x][y] = 0;
    }
  }
  for(int id=1; id<=n; id++) {
    int xl, yu, xr, yd;
    cin >> xl >> yu >> xr >> yd;
    for(int x=max(1, xl); x<=min(xr, 1280); x++) {
      for(int y=max(1, yu); y<=min(yd, 1680); y++) {
	field[x][y] = id;
      }
    }
  }
  set<int> s;
  for(int x=1; x<=1280; x++) {
    for(int y=1680; y>=0; y--) {
      if(field[x][y]!=0) {
	s.insert(field[x][y]);
	break;
      }
    }
  }
  for(int id=1; id<=n; id++) {
    if(s.find(id)!=s.end()) {
      cout << "1" << endl;
    } else {
      cout << "0" << endl;
    }
  }
  return 0;
}