#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N;
	cin >> N;
	ll P, Q;
	cin >> P >> Q;
	std::vector<ll> L(N), R(N), X(N);
	for (int i = 0; i < N; i ++) {
		ll a, b, x;
		cin >> a >> b >> x;
		X[i] = x;
		if (a + b < x) {
			puts("No");
			return 0;
		}
		L[i] = max(0ll, x - b);
		R[i] = min(a, x);
	}
	ll sx = accumulate(X.begin(), X.end(), 0ll);
	if (P + Q < sx) {
		puts("No");
		return 0;
	}
	ll Pl = max(0ll, sx - Q);
	ll sl = accumulate(L.begin(), L.end(), 0ll), sr = accumulate(R.begin(), R.end(), 0ll);
	if (sr < Pl || P < sl) {
		puts("No");
		return 0;
	}
	puts("Yes");
	P -= sl;
	for (int i = 0; i < N; i ++) {
		ll a = L[i];
		ll d = min(P, R[i] - L[i]);
		cout << a + d << " " << (X[i] - a - d) << endl;
		P -= d;
	}
}