#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

struct Point {
	int num, under, left, right;
};

bool comp(const Point& a, const Point& b) {
	if (a.under != b.under) {
		return a.under > b.under;
	}
	if (a.left != b.left) {
		return a.left < b.left;
	}
	return a.num < b.num;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int N; cin >> N;
	int left, right;
	cin >> left >> right;
	int beam[2001] = {};
	rep(i, 2001) {
		if (left <= i && i <= right) beam[i] = 1;
		else beam[i] = 0;
	}

	vector<Point> v(N);
	rep(i, N) {
		int dummy;
		cin >> v[i].left >> dummy >> v[i].right >> v[i].under;
		if (v[i].left < 0) v[i].left = 0;
		if (left)
		v[i].num = i;
	}
	sort(v.begin(), v.end(), comp);
	rep(i, N) {
		int a = v[i].num;
		int b = v[i].under;
		int c = v[i].left;
		int d = v[i].right;
		//cout << a << " " << b << " " << c << " " << d << endl;
	}
	int ans[N];
	rep(i, N) {
		int flag = 0;
		REP(j, v[i].left, v[i].right) {
			flag += beam[j];
			beam[j] = 0;
		}
		if (flag) ans[v[i].num] = 1;
		else ans[v[i].num] = 0;
	}
	rep(i, N) {
		cout << ans[i] << endl;
	}



    return 0;
}