#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

typedef long long ll;

struct ENEMY {
	int l, u, r, d;
	int id;

	bool operator<(const ENEMY &r)const {
		return d > r.d;
	}
};

int main() {
	int N; cin >> N;
	int l, r; cin >> l >> r;

	vector<ENEMY>enemy;
	for (int i = 0; i < N; i++) {
		int l, u, r, d;
		cin >> l >> u >> r >> d;
		l = max(l, 0);
		r = min(r, 1280);
		enemy.push_back(ENEMY({ l, u, r, d, i }));
	}

	sort(enemy.begin(), enemy.end());
	vector<int>ans(N);
	vector<char>used(1281);
	for (int j = l; j <= r; j++)used[j] = true;
	for (int i = 0; i < N; i++) {
		bool flag = false;
		for (int j = enemy[i].l; j <= enemy[i].r; j++) {
			if (used[j]) {
				flag = true;
				used[j] = false;
			}
		}

		ans[enemy[i].id] = flag;
	}

	for (int i = 0; i < N; i++) {
		cout << ans[i] << endl;
	}

	return 0;
}