#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>

using namespace std;


int main() {
	int i, j, k;
	int n, lb, rb;
	//vector< pair<int, pair<int, int>>> p(200);
	vector< pair<pair<int,int>, pair<int, int>>> p(200);
	bool matx[1300] = { true };
	bool ans[200] = { false };

	fill(matx, matx + 1300, true);

	for (i = 0; i < 200; i++) {
		p[i].first.first = -999999;
	}

	cin >> n >> lb >> rb;

	for (i = lb; i <= rb; i++) {
		matx[i] = false;
	}

	for (i = 0; i < n; i++) {
		int z;
		cin >> p[i].second.first;
		cin >> z;
		cin >> p[i].second.second;
		cin >> p[i].first.first;
		p[i].first.second = i;
	}

	sort(p.begin(), p.end(),greater<pair< pair<int,int>, pair<int,int>>>());

	for (i = 0; i < n; i++) {
		//bool flag2 = false;

		for (j = p[i].second.first; j <= p[i].second.second; j++) {
			if (j < 0)continue;

			if (matx[j] == false) {
				matx[j] = true;
				//flag2 = true;
				ans[p[i].first.second] = true;
			}
		}

		/*
		for (i = 0; i < 1200; i++) {
			if (matx[i] == false) {
				cout << "X";
			}
			else {
				cout << "0";
			}
		}
		cout << endl;
		cout << endl;
		cout << endl;
		cout << endl;
		cout << endl;
		cout << endl;
		*/
	}


	for (i = 0; i < n; i++) {
		if (ans[i] == true) {
			cout << 1 << endl;
		}
		else {
			cout << 0 << endl;
		}
	}


	getchar();
	getchar();
	return 0;
}