#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <stdlib.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

using mint = modint998244353;

ll gcd(ll a, ll b){
    if(a%b == 0){
      return b;
    }else{
      return gcd(b, a%b);
    }
}

ll lcm(ll a, ll b){
    return a*b / gcd(a, b);
}

ll powMod(ll x, ll n, ll mod) {
    if (n == 0) return 1 % mod;
    ll val = powMod(x, n / 2, mod);
    val *= val;
    val %= mod;
    if (n % 2 == 1) val *= x;
    return val % mod;
}

int main() {
    ll n, p, q; cin >> n >> p >> q;
    vector<ll> x(n), a(n), b(n);
    rep(i,0,n) cin >> x[i] >> a[i] >> b[i];
    vector<ll> ansa(n), ansb(n);
    rep(i,0,n){
        if(a[i] + b[i] < x[i]){
            cout << "No" << endl;
            return 0;
        }
        p -= max(0LL, x[i]-b[i]);
        q -= max(0LL, x[i]-a[i]);
        ansa[i] = max(0LL, x[i]-b[i]);
        ansb[i] = max(0LL, x[i]-a[i]);
        ll da = max(0LL,x[i]-b[i]);
        ll db = max(0LL,x[i]-a[i]);
        x[i] -= da + db;
    }
    if(p < 0 || q < 0){
        cout << "No" << endl;
        return 0;
    }
    rep(i,0,n){
        if(p > 0){
            ll d = min(p, x[i]);
            ansa[i] += d;
            p -= d;
            x[i] -= d;
        }
        if(q > 0){
            ll d = min(q, x[i]);
            ansb[i] += d;
            q -= d;
            x[i] -= d;
        }
    }
    rep(i,0,n){
        if(x[i] > 0){
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    rep(i,0,n) cout << ansa[i] << " " << ansb[i] << endl;
    return 0;
}