#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
	int N;ll P, Q;cin >> N >> P >> Q;
	vector<ll> X(N), A(N), B(N);
	for (int i = 0;i < N;i++) cin >> X[i] >> A[i] >> B[i];
	vector<ll> C(N);
	ll sa = 0;
	ll sc = 0;
	ll sx = 0;
	for (int i = 0;i < N;i++) {
		if (A[i]+B[i] < X[i]) {
			cout << "No" << endl;
			return 0;
		}
		sa += A[i];
		C[i] = max(0LL, X[i]-B[i]);
		sc += C[i];
		sx += X[i];
	
	}
	ll L = max(sc, sx - Q);
	ll R = min(P, sa);
	if (L > R) {
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	vector<ll> ret = C;
	ll now = sc;
	for (int i = 0;i < N;i++) {
		if (now == L) break;
		ll dif = L - now;
		if (C[i]+dif <= A[i]) {
			ret[i] += dif;
			break;
		} 
		ret[i] = A[i];
		now += A[i] - C[i];
	}
	for (int i = 0;i < N;i++) cout << ret[i] << " " << X[i] - ret[i] << endl;
}