#include <stdio.h>
#include <stdlib.h>

typedef struct {
	int XL, XR, YD, ans, order;
} enemy;

int compYD(const void *x, const void *y)
{
	return ((enemy*)y)->YD - ((enemy*)x)->YD;
}

int compOrder(const void *x, const void *y)
{
	return ((enemy*)x)->order - ((enemy*)y)->order;
}

int main(void)
{
	int N, xLB, xRB, width[1280] = {}, i, j;
	enemy hitJudge[188];
	scanf("%d%d%d", &N, &xLB, &xRB);
	for (i = xLB; i <= xRB; ++i) width[i - 1] = 1;
	for (i = 0; i < N; ++i) {
		scanf("%d%*d%d%d", &hitJudge[i].XL, &hitJudge[i].XR, &hitJudge[i].YD);
		if (hitJudge[i].XL < 1) hitJudge[i].XL = 1;
		if (hitJudge[i].XR > 1280) hitJudge[i].XR = 1280;
		hitJudge[i].order = i;
	}
	qsort(hitJudge, N, sizeof(enemy), compYD);
	for (i = 0; i < N; ++i) {
		for (j = hitJudge[i].XL; j <= hitJudge[i].XR; ++j) {
			if (width[j - 1] == 1) break;
		}
		if (j != hitJudge[i].XR + 1) {
			for (j = hitJudge[i].XL; j <= hitJudge[i].XR; ++j) width[j - 1] = 0;
			hitJudge[i].ans = 1;
		}
		else hitJudge[i].ans = 0;
	}
	qsort(hitJudge, N, sizeof(enemy), compOrder);
	for (i = 0; i < N; ++i) printf("%d\n", hitJudge[i].ans);
	return 0;
}