n, p, q = map(int, input().split())
pused = qused = 0
da = [0] * n
db = [0] * n
buf = [0] * n
for i in range(n):
    x, a, b = map(int, input().split())
    a = min(a, x)
    b = min(b, x)
    if a + b < x:
        print('No')
        exit()
    s = a
    t = x - a
    assert 0 <= t <= b
    pused += s
    qused += t
    da[i] = s
    db[i] = t
    buf[i] = b - t
todo = max(pused - p, 0)
if todo + qused > q:
    print('No')
    exit()
for i in range(n):
    t = min(todo, buf[i])
    da[i] -= t
    db[i] += t
    todo -= t
if todo:
    print('No')
    exit()
print('Yes')
for i in range(n):
    print(da[i], db[i])