from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import * 


n,p,q = mi() 
ans = [[0]*2 for _ in range(n)]
data = [] 

for i in range(n):
    x,a,b = mi()
    a = min(x,a) 
    b = min(x,b) 
    if a + b < x:
        pn()
        exit()
    
    need_p = x - b 
    need_q = x - a 
    data.append(x-need_p-need_q)

    p -= need_p
    q -= need_q
    ans[i] = [need_p,need_q]

if p < 0 or q < 0:
    pn()
    exit()


for i in range(n):
    nokori = data[i] 
    if p >= nokori:
        p -= nokori 
        ans[i][0] += nokori 
        continue 

    ans[i][0] += p 
    nokori -= p 
    p = 0 
    ans[i][1] += nokori 
    q -= nokori 

if q < 0:
    pn()
else:
    py()
    for i in range(n):
        print(*ans[i])