#include using namespace std; #define rep(i, a, b) for (int i = a; i < b; i++) using ll = long long; int main(){ ll n, p, q; cin >> n >> p >> q; vector x(n), a(n), b(n), ax(n), bx(n); rep(i, 0, n) cin >> x[i] >> a[i] >> b[i]; ll sx = 0; rep(i, 0, n) { if(a[i] + b[i] < x[i]) { cout << "No" << endl; return 0; } sx += x[i]; if(sx > p + q) { cout << "No" << endl; return 0; } } ll l = sx - q, h = p, smi = 0, sma = 0, s = 0; rep(i, 0, n) { int bl = max(0, x[i] - b[i]); int ah = min(a[i], x[i]); if(bl > ah) { cout << "No" << endl; return 0; } smi += bl; sma += ah; } if(sma < l || h < smi) { cout << "No" << endl; return 0; } rep(i, 0, n) { int bl = x[i] - b[i]; int ah = min(a[i], x[i]); if(bl > 0) { ax[i] = bl; s += bl; if(s < l) { s -= bl; s += ah; ax[i] = ah; } } } rep(i, 0, n) { int r = x[i] - ax[i]; int d = min(r, b[i]); bx[i] = d; a[i] += r - d; } cout << "Yes" << endl; rep(i, 0, n) { cout << ax[i] << " " << bx[i] << endl; } }