#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	long long p, q; cin >> p >> q;
	vector<long long>x(n), a(n), b(n);
	rep(i, n) {
		cin >> x[i] >> a[i] >> b[i];
		chmin(a[i], x[i]);
		chmin(b[i], x[i]);
	}
	vector<long long>l(n), r(n);
	rep(i, n) {
		if (x[i] > a[i] + b[i]) {
			cout << "No" << endl;
			return 0;
		}
		// いったんAによせる
		l[i] = a[i];
		r[i] = x[i] - a[i];
		p -= l[i];
		q -= r[i];
	}
	if (p + q < 0 || q < 0) {
		cout << "No" << endl;
		return 0;
	}
	rep(i, n) {
		long long tmp = min(a[i], b[i] - r[i]);// pの調整可能分
		chmin(tmp, -p);
		chmax(tmp, 0LL);
		p += tmp;
		q -= tmp;
		l[i] -= tmp;
		r[i] += tmp;
	}
	if (p < 0 || q < 0) {
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	rep(i, n)cout << l[i] << " " << r[i] << endl;
	return 0;
}