// yukicoder: No.678 2Dシューティングゲームの必殺ビーム
// bal4u 2019.8.19

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

//// 入出力関係
#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in()   // 整数の入力（負数対応）
{
	int n = 0, c = gc();
	if (c == '-') {	c = gc();
		do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
		return -n;
	}
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

typedef struct { int xl, xr, yu, yd, id; } T;
T tbl[200]; int N;
char ans[200];
char beam[1300];

int cmp(const void *u, const void *v) { return ((T *)v)->yd - ((T *)u)->yd; }
 
int main()
{
	int i, xl, xr, yu, yd, x, f;

	N = in(), xl = in(), xr = in(), memset(beam+xl, 1, xr-xl+1);
	for (i = 0; i < N; i++) {
		xl = in(), yu = in(), xr = in(), yd = in();
		if (xl < 0) xl = 0;
		if (xr > 1280) xr = 1280;
		tbl[i].xl = xl, tbl[i].xr = xr, tbl[i].yu = yu, tbl[i].yd = yd, tbl[i].id = i;
	}
	qsort(tbl, N, sizeof(T), cmp);
	for (i = 0; i < N; i++) {
		f = 0;
		xl = tbl[i].xl, xr = tbl[i].xr;
		for (x = xl; x <= xr; x++) {
			if (beam[x]) f = 1, beam[x] = 0;
		}
		ans[tbl[i].id] = f;
	}
	for (i = 0; i < N; i++) pc('0'+ans[i]), pc('\n');
	return 0;
}