import sequtils,strutils,algorithm,math,sugar,macros,strformat
import sets,tables,intsets,queues,heapqueue,bitops
template get*():string = stdin.readLine().strip()
macro unpack*(arr: auto,cnt: static[int]): auto =
  let t = genSym(); result = quote do:(let `t` = `arr`;())
  for i in 0..<cnt: result[1].add(quote do:`t`[`i`])
template times*(n:int,body) = (for _ in 0..<n: body)
proc toCountSeq[T](x:seq[T]) : seq[tuple[k:T,v:int]] = toSeq(x.toCountTable().pairs)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)

let (n,xLB,xRB) = get().split().map(parseInt).unpack(3)
let LURD = newSeqWith(n,get().split().map(parseInt).unpack(4))
let enLURD = toSeq(0..<n).mapIt((it,LURD[it])).sortedByIt(-it[1][3])
var limits = newSeqWith(1281,-1e8.int)
var hits = newSeq[bool](n)
for ilurd in enLURD:
  let (i,lurd) = ilurd
  let (l,u,r,d) = lurd
  for x in xLB.max(l)..xRB.min(r):
    if limits[x] >= d: continue
    limits[x] = d
    hits[i] = true
for hit in hits:
  if hit : echo 1
  else:echo 0