import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

n,lb,rb=MI()

dlr=[]
for i in range(n):
    l,u,r,d=MI()
    dlr.append((-d,l,r,i))
dlr.sort()

rb+=1
beam=(1<<rb-lb)-1<<lb
ans=[-1]*n
for d,l,r,i in dlr:
    l=max(l,0)
    r=min(r+1,1281)
    cur=(1<<r-l)-1<<l
    hit=beam&cur
    # print(bin(beam),bin(cur),bin(hit))
    if hit:
        ans[i]=1
        beam^=hit
    else:
        ans[i]=0

print(*ans,sep="\n")