N,P,Q=map(int,input().split())
fris=[list(map(int,input().split())) for i in range(N)]
seg=[]
sx=0
mim=0
mam=0
for x,a,b in fris:
    sx+=x
    a=min(a,x)
    b=min(b,x)
    seg.append((x-b,a))
    mim+=x-b
    mam+=a
    if x-b>a:
        print("No")
        exit()
lp=sx-Q
P=min(P,sx)
Q=min(Q,sy)
if lp>P:
    print("No")
    exit()
if max(mim,lp)>min(mam,P):
    print("No")
    exit()
print("Yes")
ans=[seg[i][0] for i in range(N)]
now=sum(ans)
for i in range(N):
    if now>=lp:
        break
    if now+(seg[i][1]-seg[i][0])<lp:
        ans[i]=seg[i][1]
        now+=seg[i][1]-seg[i][0]
    else:
        ans[i]+=lp-now
        now=lp
for i in range(N):
    print(ans[i],fris[i][0]-ans[i])