#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	constexpr int bias = 2000;
	int N, L, R;
	cin >> N >> L >> R;
	L += bias; R += bias;
	vector<int> LUX(N), LUY(N), RDX(N), RDY(N);
	REP(i, N) {
		scanf("%d %d %d %d", &LUX[i], &LUY[i], &RDX[i], &RDY[i]);
		LUX[i] += bias;
		LUY[i] += bias;
		RDX[i] += bias;
		RDY[i] += bias;
	}
	
	vector<bool> exist(5000);
	FOR(i, L, R + 1) exist[i] = true;
	
	vector<int> ord(N);
	iota(ALL(ord), 0);
	sort(ALL(ord), [&](int x, int y) {
		return RDY[x] > RDY[y];
	});
	
	vector<int> ans(N, false);
	for (int i : ord) {
		bool ok = false;
		FOR(j, LUX[i], RDX[i] + 1) ok |= exist[j], exist[j] = false;
		ans[i] = ok;
	}
	
	REP(i, N) printf("%d\n", ans[i]);
}