import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n, p, q = LI()
ans=[]
s = 0
xx=[]
for i in range(n):
    x, a, b = LI()
    c= max(0, x-b)
    d= max(0, x-a)
    ans.append([c,d])
    p-=c
    q-=d
    s += x-c-d
    xx.append(x)
if s>p+q or p<0 or q<0:
    print("No")
    exit()
print("Yes")
for i in range(n):
    # print(i,p,q,ans[i])
    m=min(xx[i]-sum(ans[i]),p)
    p-=m
    ans[i][0]+=m
    m=min(xx[i]-sum(ans[i]),q)
    q-=m
    ans[i][1]+=m
    print(*ans[i])